primes optimizations

primes.py

import time

def get_primes(n):
  primes=[]
  compo=set()
  in_compo=compo.__contains__
  add_prime=primes.append
  add_compo=compo.update
  for i in range(2, n):
    if in_compo(i): continue
    add_prime(i)
    add_compo(range(i*2, n,i))

def benchmark(f, n):
  def wrapped(*a, **kw):
    t0=time.time()
    for i in range(n): f(*a, **kw)
    print("dt=", time.time()-t0)
  return wrapped

benchmark(get_primes, 500)(10000)