News for hackers. Stuff that matters.
Re:Faster Integer Parsing by bch on Thursday June 25, 2020 @06:10PM (#23646342)
Are the strings checksummed, though? In this case, you’d need to do math, but still keep them as strings...
Re:Faster Integer Parsing by PeterisP on Thursday June 25, 2020 @06:20PM (#23646427)
The checksum calculation does not involve interpreting the whole multidigit number as an integer, so you don't need to parse the number; you're doing math on specific characters/digits only.
Re:Faster Integer Parsing by boring_twenties on Thursday June 25, 2020 @08:20PM (#23647372)
Wouldn't it in fact be a lot slower using an integer? Lots of divisions by 10, instead of just adding every byte.
Re:Faster Integer Parsing by userbinator on Thursday June 25, 2020 @08:27PM (#23647424)
https://en.wikipedia.org/wiki/Luhn_algorithm

There's exactly one division required.

(Implementing it using vector instructions is left as an exercise for the reader. A very elementary exercise, so I encourage you to try it if you're curious about SSE and such.)

Re:Faster Integer Parsing by Arnavion on Thursday June 25, 2020 @11:49PM (#23648504)
Luhn's algorithm works on a digit string, not a single integer.
Re:Faster Integer Parsing by im3w1l-alt on Saturday June 27, 2020 @01:03PM (#23662998)
Checking divisibility by a known constant can be done in a better way than doing a division.

https://lemire.me/blog/2019/02/08/faster-remainders-when-the...