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 8, 2026 14:26Victor MerckléVictor MerckléScore: 35,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 14:2635,032179,698,717170,652,0001,006,0002,117,632stderr
2Jul 8, 2026 14:2635,071179,992,847170,844,0001,007,0002,117,632stderr
3Jul 8, 2026 14:2635,076179,959,274170,868,0001,007,0002,117,632stderr
4Jul 8, 2026 14:2635,147180,293,597170,207,0002,014,0002,117,632stderr
5Jul 8, 2026 14:2635,200180,534,072171,475,0001,006,0002,117,632stderr
6Jul 8, 2026 14:2635,300180,948,587171,965,0001,006,0002,117,632stderr
7Jul 8, 2026 14:2635,326181,292,340170,879,0002,219,0002,117,632stderr
8Jul 8, 2026 14:2635,353181,330,935172,225,0001,006,0002,117,632stderr
9Jul 8, 2026 14:2635,462183,192,061172,762,0001,006,0002,117,632stderr