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 9, 2026 09:17Victor MerckléVictor MerckléScore: 32,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 09:1832,301166,380,157157,269,0001,010,0002,117,632stderr
2Jul 9, 2026 09:1832,312167,744,310157,318,0001,011,0002,117,632stderr
3Jul 9, 2026 09:1832,358166,660,264157,545,0001,012,0002,117,632stderr
4Jul 9, 2026 09:1832,392166,634,583157,712,0001,010,0002,117,632stderr
5Jul 9, 2026 09:1832,425166,766,923157,873,0001,010,0002,117,632stderr
6Jul 9, 2026 09:1832,448167,601,866157,986,0001,010,0002,117,632stderr
7Jul 9, 2026 09:1832,663167,936,181159,038,0001,012,0002,117,632stderr
8Jul 9, 2026 09:1832,692168,286,281159,179,0001,012,0002,117,632stderr
9Jul 9, 2026 09:1833,201170,662,411161,682,0001,007,0002,117,632stderr