Efficient algorithm for finding the k-th prime number?

Question

Python

Hello! I need an efficient algorithm for finding the kth prime number in python. I tried to put a counter, but it turns out a lot of computational complexity. If there is an implementation with an erastofen sieve, please give it. Help me please!

def IsPrime(n):
    d = 2
    while d * d <= n and n % d != 0:
        d += 1
    return d * d > n
check = False
n = int(input())
i = 1
s = 0
numbers = []
while s < n:
    i += 1
    if IsPrime(i):
        numbers.append(i)
        s += 1
    else:
        continue
print(numbers[n - 1])

Answer 1

Help is coming