language: Python 3 (python-3.2.3)
date: 1094 days 11 hours ago
link:
visibility: public 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30

def prime_numbers(limit=1000000):
    '''Prime number generator. Yields the series
    2, 3, 5, 7, 11, 13, 17, 19, 23, 29 ...    
    using Sieve of Eratosthenes.
    '''
    yield 2
    sub_limit = int(limit**0.5) 
    flags = [False, False] + [True] * (limit - 2)   
    # Step through all the odd numbers
    for i in range(3, limit, 2):       
        if flags[i] is False:
            continue
        yield i
        # Exclude further multiples of the current prime number
        if i <= sub_limit:
            for j in range(i*3, limit, i<<1):
                flags[j] = False
                
def test():
    primes1 = []
    for x in prime_numbers(1000000):
        primes1.append(x)
    return primes1
        
if __name__ == '__main__':
    from time import time
    start = time()
    primes = test()
    print(time() - start, "seconds")
#    print('\n'.join(str(p) for p in primes))