Question: 
Write a python function to find sum of all prime divisors of a given number.


Model's Code:
def Sum(n):
    def is_prime(num):
        if num < 2:
            return False
        for i in range(2, int(num**0.5) + 1):
            if num % i == 0:
                return False
        return True

    prime_divisors = set()
    for i in range(2, n + 1):
        if n % i == 0 and is_prime(i):
            prime_divisors.add(i)

    return sum(prime_divisors)



Sample Correct Code:
def Sum(N): 
    SumOfPrimeDivisors = [0]*(N + 1)   
    for i in range(2,N + 1) : 
        if (SumOfPrimeDivisors[i] == 0) : 
            for j in range(i,N + 1,i) : 
                SumOfPrimeDivisors[j] += i           
    return SumOfPrimeDivisors[N] 


Asserts:
assert Sum(60) == 10
assert Sum(39) == 16
assert Sum(40) == 7


Tests:
Test 1 of 3: PASS
Test 2 of 3: PASS
Test 3 of 3: PASS

Test 849 of 974: 653/849 (76.91401648998823%): success