Project Euler #10

euler10.py

from itertools import count
from itertools import takewhile

def prime():
    primes = []
    for n in count(2):
        composite = 0
        for p in primes:
            if not n % p:
                composite = 1
                break
            elif p ** 2 > n:
                break
        if not composite:
            primes.append(n)
            yield n

print sum(takewhile(lambda p: p < 2000000, prime()))