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 24, 2026 23:50Victor MerckléVictor MerckléScore: 32,082Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 23:5131,752164,028,814153,557,0002,029,0002,117,632stderr
2Aug 24, 2026 23:5131,980165,102,859155,695,0001,011,0002,117,632stderr
3Aug 24, 2026 23:5132,009165,233,429155,835,0001,010,0002,117,632stderr
4Aug 24, 2026 23:5132,058165,524,204156,075,0001,014,0002,117,632stderr
5Aug 24, 2026 23:5132,082165,565,307156,195,0001,011,0002,117,632stderr
6Aug 24, 2026 23:5132,170166,077,063156,624,0001,010,0002,117,632stderr
7Aug 24, 2026 23:5132,365166,959,872157,583,0001,009,0002,117,632stderr
8Aug 24, 2026 23:5132,582167,993,517158,643,0001,011,0002,117,632stderr
9Aug 24, 2026 23:5132,734168,807,447159,389,0001,008,0002,117,632stderr