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 listJul 5, 2026 21:37Victor MerckléVictor MerckléScore: 39,306Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 21:3838,965198,714,066187,084,0003,848,00024,576stderr
2Jul 5, 2026 21:3839,206199,879,931187,749,0004,362,00024,576stderr
3Jul 5, 2026 21:3839,236200,172,914188,467,0003,794,00024,576stderr
4Jul 5, 2026 21:3839,303200,276,389188,472,0004,113,0002,117,632stderr
5Jul 5, 2026 21:3839,306200,403,571188,601,0003,999,00024,576stderr
6Jul 5, 2026 21:3839,355200,725,908189,130,0003,710,00024,576stderr
7Jul 5, 2026 21:3839,503201,320,783189,327,0004,241,0002,117,632stderr
8Jul 5, 2026 21:3839,510201,406,211188,853,0004,747,00024,576stderr
9Jul 5, 2026 21:3839,562201,606,095189,381,0004,474,00024,576stderr