Project Euler #7: 10001st prime.py

import time

start_time = time.time()


def get_primes(n):
    for i in range(2, n):
        for j in range(2, int(i**0.5)+1):
            if i % j == 0:
                break
        else:
            yield i


def solution(n):
    for i, j in enumerate(get_primes(100*n)):
        if i == n:
            return j


print(solution(10000))
print("--- %s seconds ---" % (time.time() - start_time))