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 15:51Victor MerckléVictor MerckléScore: 27,459Success
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 15:5127,380142,494,015133,145,0001,020,0002,117,632stderr
2Aug 25, 2026 15:5127,407142,674,318133,272,0001,027,0002,117,632stderr
3Aug 25, 2026 15:5127,424142,737,948133,360,0001,021,0002,117,632stderr
4Aug 25, 2026 15:5127,457142,944,744133,448,0001,092,0002,117,632stderr
5Aug 25, 2026 15:5127,459142,920,658133,462,0001,089,0002,117,632stderr
6Aug 25, 2026 15:5127,460142,961,296133,461,0001,095,0002,117,632stderr
7Aug 25, 2026 15:5127,470142,946,813133,504,0001,102,0002,117,632stderr
8Aug 25, 2026 15:5127,474143,025,221133,493,0001,130,0002,117,632stderr
9Aug 25, 2026 15:5127,491143,094,129133,609,0001,099,0002,117,632stderr