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 01:28Victor MerckléVictor MerckléScore: 28,982Success
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 01:2828,883149,869,511139,510,0002,017,0002,117,632stderr
2Aug 25, 2026 01:2828,894149,994,106140,572,0001,009,0002,117,632stderr
3Aug 25, 2026 01:2828,930150,206,416139,736,0002,025,0002,117,632stderr
4Aug 25, 2026 01:2828,935150,167,892140,775,0001,008,0002,117,632stderr
5Aug 25, 2026 01:2828,982150,405,092141,006,0001,009,0002,117,632stderr
6Aug 25, 2026 01:2829,075150,876,981141,462,0001,010,0002,117,632stderr
7Aug 25, 2026 01:2829,202151,438,732142,084,0001,010,0002,117,632stderr
8Aug 25, 2026 01:2829,218151,547,080142,160,0001,009,0002,117,632stderr
9Aug 25, 2026 01:2829,564153,310,083142,859,0002,007,0002,117,632stderr