Sum Of Prime

Write a function sumprimes(l) that takes as input a list of integers and retuns the sum of all the prime numbers in l.


def sumprimes(l):
    sum=0
    for i in range(len(l)):
      if l[i]>0:
        j=i
        flag=0
        for k in range(2,l[i]):
            if l[j]%k==0:
                flag=1
                break
        if flag==0:
           sum=sum+l[j]

    return sum