The sum of the primes below 10 is
Find the sum of all the primes below two million.
Runtime: 0
Average: 0 Runs: 0
SD: 0 ms
Max: 0
Min: 1000
I used a seive of Eratosthenes to generate an array of primes up to 2,000,000.
Then I added up all of the numbers in my array. This was much faster than
primality testing.