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 3, 2026 21:29Victor MerckléVictor MerckléScore: 49,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 21:2948,976248,327,222237,955,0002,030,0002,117,632stderr
2Jul 3, 2026 21:2948,977247,930,805237,813,0002,176,0002,117,632stderr
3Jul 3, 2026 21:2949,051248,677,421238,345,0002,008,0002,117,632stderr
4Jul 3, 2026 21:2949,065248,706,895238,398,0002,022,0002,117,632stderr
5Jul 3, 2026 21:2949,108248,663,720238,438,0002,192,0002,117,632stderr
6Jul 3, 2026 21:2949,198249,500,093238,881,0002,194,0002,117,632stderr
7Jul 3, 2026 21:2949,203251,874,500239,035,0002,061,0002,117,632stderr
8Jul 3, 2026 21:2949,696251,443,852241,498,0002,013,0002,117,632stderr
9Jul 3, 2026 21:2951,979262,745,093252,525,0002,174,0002,117,632stderr