Answer by MrHIDEn for Sieve of Eratosthenes - Finding Primes Python

Much faster:

import timedef get_primes(n):  m = n+1  #numbers = [True for i in range(m)]  numbers = [True] * m #EDIT: faster  for i in range(2, int(n**0.5 + 1)):    if numbers[i]:      for j in range(i*i, m, i):        numbers[j] = False  primes = []  for i in range(2, m):    if numbers[i]:      primes.append(i)  return primesstart = time.time()primes = get_primes(10000)print(time.time() - start)print(get_primes(100))