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 4, 2026 13:23Victor MerckléVictor MerckléScore: 46,744Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 13:2446,686236,754,368226,728,0002,038,0002,117,632stderr
2Jul 4, 2026 13:2446,686236,740,558226,682,0002,081,0002,117,632stderr
3Jul 4, 2026 13:2446,729237,341,778226,931,0002,042,0002,117,632stderr
4Jul 4, 2026 13:2446,734236,997,795226,950,0002,048,0002,117,632stderr
5Jul 4, 2026 13:2446,744237,039,693227,018,0002,032,0002,117,632stderr
6Jul 4, 2026 13:2446,768237,176,098227,159,0002,005,0002,117,632stderr
7Jul 4, 2026 13:2446,793237,302,288227,236,0002,054,0002,117,632stderr
8Jul 4, 2026 13:2446,875237,936,653227,677,0002,015,0002,117,632stderr
9Jul 4, 2026 13:2447,410240,252,604230,277,0002,032,0002,117,632stderr