Am I missing something?
6 digits are 1 million entries, probably using substr is even faster than array lookup, for sure it's demanding less memory.
Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery
FootballPerl is like chess, only without the dice
In reply to Re^2: Faster Luhn Check Digit Calculation?
by LanX
in thread Faster Luhn Check Digit Calculation?
by kschwab
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |