Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- primes = []
- M = 5*int(1e9)+5
- buffer_size = int(1e7)
- for start in range(0, M, buffer_size):
- buffer_seive = buffer_size*[True]
- for i in primes:
- j = (start//i)*i
- while j < start + buffer_size:
- if j >= start:
- buffer_seive[j-start]=False
- j += i
- for i in range(max(2, start), start + buffer_size):
- if buffer_seive[i-start]:
- primes.append(i)
- j = i*i
- while j < start+buffer_size:
- buffer_seive[j-start]=False
- j+=i
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement