Solution to Project Euler problem #10

prog10.py

from functools import reduce

def eratosthenes(n):
    primes = []
    sieve = [True for _ in range(n+1)]
    p = 2
    while p**2 <= n:
        m = p**2
        while m <= n:
            sieve[m] = False
            m += p
        p += 1
        while not sieve[p]:
            p += 1
    for i in range(2, n+1):
        if sieve[i]:
            primes.append(i)
    return primes

if __name__ == "__main__":
    primes = eratosthenes(2_000_000)
    sum_primes = reduce(lambda x, y: x + y, primes)
    print(sum_primes)