Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Inefficient solution in Creative category for CheckSum by ale1ster
def checkio(d, r=lambda i,n: sum(map(int, str(n))) if i%2 else n):
h = sum(r(i, (1+i%2)*(ord(c)-48)) for (i, c) in \
enumerate([d for d in d if d.isalnum()][::-1], 1))
return [str(-(h % 10) % 10), h]
Aug. 1, 2014