Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listSep 3, 2026 18:48Victor MerckléVictor MerckléScore: 25,521Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 18:4925,510133,467,305123,967,0001,033,0002,117,632stderr
2Sep 3, 2026 18:4925,514133,520,653123,966,0001,053,0002,117,632stderr
3Sep 3, 2026 18:4925,520133,513,883123,935,0001,113,0002,117,632stderr
4Sep 3, 2026 18:4925,520133,539,775123,954,0001,098,0002,117,632stderr
5Sep 3, 2026 18:4925,521133,583,829123,961,0001,092,0002,117,632stderr
6Sep 3, 2026 18:4925,531133,587,483123,987,0001,118,0002,117,632stderr
7Sep 3, 2026 18:4925,544134,336,948123,976,0001,193,0002,117,632stderr
8Sep 3, 2026 18:4925,546136,501,606124,080,0001,100,0002,117,632stderr
9Sep 3, 2026 18:4925,710135,502,221124,837,0001,146,0002,117,632stderr