import time
def is_prime(n):
for i in range(2, int(n**0.5)+1):
if n%i == 0:
return False
return True
times = []
for i in range(50):
num = 0
primes_found = 0
begin_time = time.time()
while primes_found != 10000:
if is_prime(num):
primes_found += 1
num += 1
times.append(time.time() - begin_time)
print "Average Time: {:f}ms".format((sum(times)/len(times))*1000)