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 13:46Victor MerckléVictor MerckléScore: 46,042Success
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 13:4745,919233,058,249222,957,0002,048,0002,117,632stderr
2Jul 4, 2026 13:4745,964233,282,588223,140,0002,086,0002,117,632stderr
3Jul 4, 2026 13:4745,966233,005,255223,215,0002,022,0002,117,632stderr
4Jul 4, 2026 13:4746,040233,688,570223,521,0002,078,0002,117,632stderr
5Jul 4, 2026 13:4746,042233,569,873223,584,0002,022,0002,117,632stderr
6Jul 4, 2026 13:4746,197234,336,276224,340,0002,027,0002,117,632stderr
7Jul 4, 2026 13:4746,634236,519,324226,470,0002,040,0002,117,632stderr
8Jul 4, 2026 13:4747,191239,244,600229,204,0002,034,0002,117,632stderr
9Jul 4, 2026 13:4747,515240,782,643230,821,0002,007,0002,117,632stderr