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 23:00Victor MerckléVictor MerckléScore: 25,439Success
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 23:0025,409132,946,091123,485,0001,021,0002,117,632stderr
2Sep 3, 2026 23:0025,417132,968,332123,531,0001,016,0002,117,632stderr
3Sep 3, 2026 23:0025,423132,983,549123,545,0001,028,0002,117,632stderr
4Sep 3, 2026 23:0025,437133,042,656123,575,0001,067,0002,117,632stderr
5Sep 3, 2026 23:0025,439133,161,317123,549,0001,106,0002,117,632stderr
6Sep 3, 2026 23:0025,453133,216,463123,624,0001,100,0002,117,632stderr
7Sep 3, 2026 23:0025,454134,295,091123,586,0001,142,0002,117,632stderr
8Sep 3, 2026 23:0025,461133,239,550123,674,0001,087,0002,117,632stderr
9Sep 3, 2026 23:0025,620134,014,188124,451,0001,088,0002,117,632stderr