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 03:39Victor MerckléVictor MerckléScore: 48,510Success
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 03:4048,448245,380,533235,390,0002,006,0002,117,632stderr
2Jul 4, 2026 03:4048,468245,334,488235,423,0002,073,0002,117,632stderr
3Jul 4, 2026 03:4048,495245,447,058235,548,0002,079,0002,117,632stderr
4Jul 4, 2026 03:4048,496245,911,406235,628,0002,007,0002,117,632stderr
5Jul 4, 2026 03:4048,510245,737,064235,608,0002,094,0002,117,632stderr
6Jul 4, 2026 03:4048,539245,602,091235,726,0002,116,0002,117,632stderr
7Jul 4, 2026 03:4048,549245,681,520235,718,0002,173,0002,117,632stderr
8Jul 4, 2026 03:4048,554246,034,654235,906,0002,010,0002,117,632stderr
9Jul 4, 2026 03:4048,837247,273,854237,287,0002,015,0002,117,632stderr