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 21:36Victor MerckléVictor MerckléScore: 25,669Success
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 21:3625,634134,063,266124,576,0001,034,0002,117,632stderr
2Sep 3, 2026 21:3625,661134,200,245124,655,0001,088,0002,117,632stderr
3Sep 3, 2026 21:3625,664134,293,828124,652,0001,105,0002,117,632stderr
4Sep 3, 2026 21:3625,668134,486,043124,682,0001,093,0002,117,632stderr
5Sep 3, 2026 21:3625,669134,291,011124,656,0001,125,0002,117,632stderr
6Sep 3, 2026 21:3625,673134,263,094124,698,0001,101,0002,117,632stderr
7Sep 3, 2026 21:3625,688137,060,879124,771,0001,103,0002,117,632stderr
8Sep 3, 2026 21:3625,691134,447,634124,793,0001,095,0002,117,632stderr
9Sep 3, 2026 21:3625,697135,016,149124,716,0001,201,0002,117,632stderr