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 2, 2026 04:16Victor MerckléVictor MerckléScore: 26,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 04:1726,531138,476,140128,902,0001,103,0002,117,632stderr
2Sep 2, 2026 04:1726,537138,473,875128,947,0001,088,0002,117,632stderr
3Sep 2, 2026 04:1726,540138,460,667128,960,0001,089,0002,117,632stderr
4Sep 2, 2026 04:1726,546138,541,398128,967,0001,113,0002,117,632stderr
5Sep 2, 2026 04:1726,546138,498,423128,985,0001,092,0002,117,632stderr
6Sep 2, 2026 04:1726,549138,532,246128,985,0001,106,0002,117,632stderr
7Sep 2, 2026 04:1726,552138,553,310129,007,0001,100,0002,117,632stderr
8Sep 2, 2026 04:1726,554138,533,203129,009,0001,106,0002,117,632stderr
9Sep 2, 2026 04:1726,584138,691,939129,005,0001,258,0002,117,632stderr