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:41Victor MerckléVictor MerckléScore: 25,550Success
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:4225,509133,415,046123,963,0001,034,0002,117,632stderr
2Sep 3, 2026 23:4225,542133,608,794124,066,0001,092,0002,117,632stderr
3Sep 3, 2026 23:4225,546135,567,313124,094,0001,084,0002,117,632stderr
4Sep 3, 2026 23:4225,547133,658,149124,069,0001,112,0002,117,632stderr
5Sep 3, 2026 23:4225,550133,680,388124,099,0001,096,0002,117,632stderr
6Sep 3, 2026 23:4225,550133,642,623124,103,0001,093,0002,117,632stderr
7Sep 3, 2026 23:4225,551133,689,011124,097,0001,106,0002,117,632stderr
8Sep 3, 2026 23:4225,555133,690,753124,124,0001,100,0002,117,632stderr
9Sep 3, 2026 23:4225,603133,901,728124,187,0001,269,0002,117,632stderr