Eulers sieve example in python

gistfile1.py

# find sum of all non-prime numbers in range(100)
def eulers_sieve(n):
    c = range(n+1)
    fin = int(n**0.5)
    for i in xrange(2, fin+1):
        if not c[i]:
            continue
        c[2*i::i] = [None] * (n//i - 1)
    return [i for i in c[2:] if i]

if __name__ == "__main__":
    pirmsk_sum= sum(eulers_sieve(100))
    print sum(range(100)) - pirmsk_sum