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 24, 2026 18:45Victor MerckléVictor MerckléScore: 29,869Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 18:4729,710154,027,269143,442,0002,141,0002,117,632stderr
2Aug 24, 2026 18:4729,779154,944,327143,909,0002,009,0002,117,632stderr
3Aug 24, 2026 18:4729,817154,716,281145,096,0001,010,0002,117,632stderr
4Aug 24, 2026 18:4729,865154,746,589144,333,0002,006,0002,117,632stderr
5Aug 24, 2026 18:4729,869155,379,979145,350,0001,009,0002,117,632stderr
6Aug 24, 2026 18:4729,936155,096,767145,678,0001,010,0002,117,632stderr
7Aug 24, 2026 18:4729,944155,041,600144,696,0002,034,0002,117,632stderr
8Aug 24, 2026 18:4729,972155,858,426144,828,0002,039,0002,117,632stderr
9Aug 24, 2026 18:4731,022160,344,422149,917,0002,093,0002,117,632stderr