如何用Python求素数之和

def isPrime(n) :

    for i in range(2,n):

        if n % i == 0:

            return 0

            break

    else:

        return n

def primeSum(x,y):

    e = 0

    for n in range(x,y):

        w = isPrime(n)

        e = w + e

    return e

x,y =map(int, input().split())

print(primeSum(x,y))