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 16:43Victor MerckléVictor MerckléScore: 37,502Success
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 16:4437,167191,520,631179,678,0002,444,00024,576stderr
2Jul 7, 2026 16:4437,286190,544,027180,598,0002,105,0002,117,632stderr
3Jul 7, 2026 16:4437,303190,707,069178,656,0004,131,00024,576stderr
4Jul 7, 2026 16:4437,383190,950,927179,960,0003,220,0002,117,632stderr
5Jul 7, 2026 16:4437,502191,611,219179,278,0004,485,0002,117,632stderr
6Jul 7, 2026 16:4438,011194,373,837181,689,0004,567,00024,576stderr
7Jul 7, 2026 16:4441,537211,382,389186,932,00016,604,00024,576stderr
8Jul 7, 2026 16:4441,613211,938,011187,448,00016,459,00024,576stderr
9Jul 7, 2026 16:4441,883213,334,421188,210,00017,020,00024,576stderr