# Updaed to be the sum of primes < 2,000,000
# Brute force really isn't an option.
import math

limit = 2000000

sieve = [True for i in range(0, limit)]
sieve[0] = sieve[1] = False

upperLim = int(math.ceil(math.sqrt(limit)))

for n in range(2, upperLim):
	if sieve[n] == True:
		for i in range(n+n, limit, n):
			sieve[i] = False

print sum([index for index, value in enumerate(sieve) if value == True])