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 22:35Victor MerckléVictor MerckléScore: 48,367Success
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 22:3648,150245,204,748233,918,0002,020,0002,117,632stderr
2Jul 4, 2026 22:3648,182243,879,194234,013,0002,082,0002,117,632stderr
3Jul 4, 2026 22:3648,207243,973,242234,206,0002,011,0002,117,632stderr
4Jul 4, 2026 22:3648,215244,008,222234,200,0002,057,0002,117,632stderr
5Jul 4, 2026 22:3648,367245,130,372234,983,0002,016,0002,117,632stderr
6Jul 4, 2026 22:3648,465245,280,226235,438,0002,043,0002,117,632stderr
7Jul 4, 2026 22:3648,472245,329,921235,469,0002,048,0002,117,632stderr
8Jul 4, 2026 22:3648,495245,561,570235,558,0002,069,0002,117,632stderr
9Jul 4, 2026 22:3648,508245,700,524235,666,0002,025,0002,117,632stderr