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 08:45Victor MerckléVictor MerckléScore: 31,237Success
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 08:4531,189161,248,262151,810,0001,020,0002,117,632stderr
2Aug 25, 2026 08:4531,219161,335,953151,891,0001,086,0002,117,632stderr
3Aug 25, 2026 08:4531,220161,375,710151,885,0001,094,0002,117,632stderr
4Aug 25, 2026 08:4531,236161,468,162151,978,0001,083,0002,117,632stderr
5Aug 25, 2026 08:4531,237161,473,124151,967,0001,098,0002,117,632stderr
6Aug 25, 2026 08:4531,241161,505,705151,994,0001,090,0002,117,632stderr
7Aug 25, 2026 08:4531,248161,521,282152,099,0001,021,0002,117,632stderr
8Aug 25, 2026 08:4531,268161,628,966152,114,0001,103,0002,117,632stderr
9Aug 25, 2026 08:4531,274161,626,897152,134,0001,112,0002,117,632stderr