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 14, 2026 04:43Victor MerckléVictor MerckléScore: 29,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 04:4329,400152,143,009143,053,0001,009,0002,117,632stderr
2Jul 14, 2026 04:4329,467152,505,696142,384,0002,006,0002,117,632stderr
3Jul 14, 2026 04:4329,471152,485,934143,398,0001,011,0002,117,632stderr
4Jul 14, 2026 04:4329,514152,735,039143,610,0001,010,0002,117,632stderr
5Jul 14, 2026 04:4329,543153,353,111142,731,0002,031,0002,117,632stderr
6Jul 14, 2026 04:4329,572152,978,256143,898,0001,009,0002,117,632stderr
7Jul 14, 2026 04:4329,608153,229,545143,011,0002,073,0002,117,632stderr
8Jul 14, 2026 04:4329,662153,541,649143,312,0002,033,0002,117,632stderr
9Jul 14, 2026 04:4329,871154,507,959144,338,0002,034,0002,117,632stderr