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 09:46Victor MerckléVictor MerckléScore: 31,495Success
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 09:4631,441161,876,049153,056,0001,008,0002,117,632stderr
2Jul 8, 2026 09:4631,453162,161,573153,109,0001,011,0002,117,632stderr
3Jul 8, 2026 09:4631,456162,082,026152,100,0002,037,0002,117,632stderr
4Jul 8, 2026 09:4631,467162,052,838153,181,0001,009,0002,117,632stderr
5Jul 8, 2026 09:4631,495162,189,678152,309,0002,019,0002,117,632stderr
6Jul 8, 2026 09:4631,538162,452,816153,531,0001,008,0002,117,632stderr
7Jul 8, 2026 09:4631,554162,498,474153,607,0001,009,0002,117,632stderr
8Jul 8, 2026 09:4631,687163,415,702154,258,0001,012,0002,117,632stderr
9Jul 8, 2026 09:4631,979164,612,929155,687,0001,011,0002,117,632stderr