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 16:11Victor MerckléVictor MerckléScore: 27,393Success
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 16:1127,324142,350,204132,866,0001,023,0002,117,632stderr
2Aug 25, 2026 16:1127,380142,625,592133,077,0001,089,0002,117,632stderr
3Aug 25, 2026 16:1127,386142,628,781133,105,0001,090,0002,117,632stderr
4Aug 25, 2026 16:1127,393142,665,475133,117,0001,111,0002,117,632stderr
5Aug 25, 2026 16:1127,393142,674,857133,133,0001,097,0002,117,632stderr
6Aug 25, 2026 16:1127,402142,680,458133,170,0001,103,0002,117,632stderr
7Aug 25, 2026 16:1127,403142,801,472133,184,0001,095,0002,117,632stderr
8Aug 25, 2026 16:1127,403142,716,698133,178,0001,101,0002,117,632stderr
9Aug 25, 2026 16:1127,411142,687,444133,308,0001,006,0002,117,632stderr