#!/usr/bin/env python

from eulerfuncs import isPrime

if __name__ == '__main__':
  primes = [2]
  for n in range(3, 2000000, 2):
    if isPrime(n):
      primes.append(n)
  total = sum(primes)
  print(total)

3c86caab58b0c8afd30a74fce7fec4fd5947376f
<mask token>

<mask token>
if __name__ == '__main__':
    primes = [2]
    for n in range(3, 2000000, 2):
        if isPrime(n):
            primes.append(n)
    total = sum(primes)
    print(total)

from eulerfuncs import isPrime
if __name__ == '__main__':
    primes = [2]
    for n in range(3, 2000000, 2):
        if isPrime(n):
            primes.append(n)
    total = sum(primes)
    print(total)

#!/usr/bin/env python

from eulerfuncs import isPrime

if __name__ == '__main__':
  primes = [2]
  for n in range(3, 2000000, 2):
    if isPrime(n):
      primes.append(n)
  total = sum(primes)
  print(total)
