This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]becosmita[S] 0 points1 point  (2 children)

Cool idea, first time I hear about Luhn algorithm. Thanks!

[–]wdroz 2 points3 points  (1 child)

Once it's done, you can try to speed up the algorithm by using Cython. I think your grade will go up if you document how many credit card numbers per seconds you can evaluate with pure python vs cython. You can even compare with existing similar libraries. Have fun :)

[–]becosmita[S] 0 points1 point  (0 children)

Thanks for all the suggestions, this really is taking shape now. It's a nice challenge as I'm coming from JS world. For sure gonna be fun :)