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 7, 2026 18:47Victor MerckléVictor MerckléScore: 33,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 18:4832,760168,408,327154,704,0005,823,00024,576stderr
2Jul 7, 2026 18:4833,108170,310,640155,856,0006,376,0002,117,632stderr
3Jul 7, 2026 18:4833,149170,402,093156,349,0006,085,00024,576stderr
4Jul 7, 2026 18:4833,447171,818,368157,552,0006,343,0002,117,632stderr
5Jul 7, 2026 18:4833,533172,244,185157,018,0007,296,0002,117,632stderr
6Jul 7, 2026 18:4834,067174,758,687160,524,0006,406,0002,117,632stderr
7Jul 7, 2026 18:4834,686178,233,548158,255,00011,710,00024,576stderr
8Jul 7, 2026 18:4834,710177,891,252158,213,00011,866,00024,576stderr
9Jul 7, 2026 18:4835,012179,376,416159,792,00011,768,00024,576stderr