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 3, 2026 21:04Victor MerckléVictor MerckléScore: 50,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 21:0550,029253,213,572243,141,0002,004,0002,117,632stderr
2Jul 3, 2026 21:0550,040253,105,289243,177,0002,020,0002,117,632stderr
3Jul 3, 2026 21:0550,061253,197,193243,265,0002,034,0002,117,632stderr
4Jul 3, 2026 21:0550,101253,451,858243,473,0002,024,0002,117,632stderr
5Jul 3, 2026 21:0550,143253,616,165243,646,0002,056,0002,117,632stderr
6Jul 3, 2026 21:0550,156254,165,872243,761,0002,006,0002,117,632stderr
7Jul 3, 2026 21:0550,212253,921,157244,009,0002,032,0002,117,632stderr
8Jul 3, 2026 21:0550,510255,935,563245,489,0002,011,0002,117,632stderr
9Jul 3, 2026 21:0551,089258,062,443248,309,0002,031,0002,117,632stderr