primebench.py

from math import sqrt
import time

def is_prime(n):
    if n == 1 or (n > 2 and n % 2 == 0):
        return False
    else:
        rbool = True
        sroot = int(sqrt(n) + 1)
        for i in range(3,sroot,2): 
            if n % i == 0:
                rbool = False
                break
        return rbool

start = time.time()
for _ in range(100):
    list(map(is_prime, range(1000000)))
duration = time.time() - start
print(duration)