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 listAug 25, 2026 09:45Victor MerckléVictor MerckléScore: 38,344Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 09:4638,241195,767,162186,361,0001,023,0002,117,632stderr
2Aug 25, 2026 09:4638,326196,890,468186,699,0001,101,0002,117,632stderr
3Aug 25, 2026 09:4638,326196,065,983186,698,0001,102,0002,117,632stderr
4Aug 25, 2026 09:4638,333196,965,621186,736,0001,100,0002,117,632stderr
5Aug 25, 2026 09:4638,344196,926,618186,789,0001,099,0002,117,632stderr
6Aug 25, 2026 09:4638,349196,294,170186,814,0001,100,0002,117,632stderr
7Aug 25, 2026 09:4638,350197,037,214186,810,0001,109,0002,117,632stderr
8Aug 25, 2026 09:4638,359197,028,862186,853,0001,108,0002,117,632stderr
9Aug 25, 2026 09:4638,363197,040,339186,881,0001,101,0002,117,632stderr