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 5, 2026 21:16Victor MerckléVictor MerckléScore: 34,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 21:1733,903174,038,291165,120,0001,007,0002,117,632stderr
2Jul 5, 2026 21:1733,968174,279,115164,434,0002,013,0002,117,632stderr
3Jul 5, 2026 21:1733,971174,350,759165,455,0001,006,0002,117,632stderr
4Jul 5, 2026 21:1734,052174,652,091165,852,0001,006,0002,117,632stderr
5Jul 5, 2026 21:1734,071174,906,383164,757,0002,192,0002,117,632stderr
6Jul 5, 2026 21:1734,089174,885,613166,033,0001,005,0002,117,632stderr
7Jul 5, 2026 21:1734,091174,847,090166,040,0001,006,0002,117,632stderr
8Jul 5, 2026 21:1734,264175,767,119166,889,0001,007,0002,117,632stderr
9Jul 5, 2026 21:1734,325175,961,014167,190,0001,006,0002,117,632stderr