2 ms·
That’s more elaborate than BM_Naive from the article, which takes over 10 times the time of their last version. Reason? the next to last iteration of the code
by Someone 6y ago
That’s more elaborate than BM_Naive from the article, which takes over 10 times the time of their last version.
Reason? the next to last iteration of the code grabs 8 characters in an unsigned long, parses them, grabs 8 more characters, parses them, multiplies the first number by 100,000,000, and adds it to the second.
So, it does 2 iterations per 16-digit number, not 16.
The last result further improves on that by grabbing all 16 digits in one go.