Solver for Primel (https://converged.yt/primel/)

primel.py

# A Primel Solver

# Sieve of Eratosthenes
N = 100000
primes = [True] * N
for i in range(2, N):

    if not primes[i]:
        continue

    k = i + i

    while k < N:
        primes[k] = False
        k += i

useful = [ str(i) if primes[i] and len(str(i)) == 5 ]

# Plugin in your clues
for i in useful:
    if i[0] == '6' and i[4] == '9' and ('3' in i) and ('5' in i) and ('8' in i):
        print(i)