1.py

import math
import time


def is_prime(n):
    if n % 2 == 0:
        return False
    sqrt_n = int(math.floor(math.sqrt(n)))
    for i in range(3, sqrt_n + 1, 2):
        if n % i == 0:
            return False
    return True


begin = time.time()
for x in range(1, 500000):
    is_prime(x)
print(round(100*float(time.time() - begin))/100)