Prime Finder

from math import sqrt
from time import time, sleep

def is_prime (n):
    nsqrt = int (sqrt (n) + 0.5)
    for x in range (2, nsqrt):
        if n % x == 0:
            return False
    else:
        return True

max = int (input ("Max number?\n"))
primes = []

stime = time ()
for x in range (1, max):
    if is_prime (x):
        primes.append (x)
    if x % 10000 == 0:
        print (int ((x/max) * 100), "%")

etime = time () - stime

print ('\n')

for p in primes:
    print (p)

print ("{} seconds \n ({} numbers / second)".format (etime, max / etime))