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 06:02Victor MerckléVictor MerckléScore: 28,158Success
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 06:0328,128146,257,265135,824,0002,006,0002,117,632stderr
2Aug 25, 2026 06:0328,136146,047,525135,858,0002,011,0002,117,632stderr
3Aug 25, 2026 06:0328,140146,260,270136,877,0001,010,0002,117,632stderr
4Aug 25, 2026 06:0328,146146,301,309136,909,0001,010,0002,117,632stderr
5Aug 25, 2026 06:0328,158146,361,911136,970,0001,009,0002,117,632stderr
6Aug 25, 2026 06:0328,164146,400,455136,997,0001,011,0002,117,632stderr
7Aug 25, 2026 06:0328,173146,479,508137,040,0001,010,0002,117,632stderr
8Aug 25, 2026 06:0328,190146,516,113136,127,0002,007,0002,117,632stderr
9Aug 25, 2026 06:0328,200146,562,634136,156,0002,024,0002,117,632stderr