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 6, 2026 14:28Victor MerckléVictor MerckléScore: 34,346Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 14:3334,105174,901,625166,112,0001,007,0002,117,632stderr
2Jul 6, 2026 14:3334,255175,593,221166,845,0001,007,0002,117,632stderr
3Jul 6, 2026 14:3334,296176,122,258167,043,0001,008,0002,117,632stderr
4Jul 6, 2026 14:3334,330175,994,616166,191,0002,026,0002,117,632stderr
5Jul 6, 2026 14:3334,346176,075,574167,291,0001,007,0002,117,632stderr
6Jul 6, 2026 14:3334,446176,588,725167,781,0001,006,0002,117,632stderr
7Jul 6, 2026 14:3334,503176,787,689168,060,0001,006,0002,117,632stderr
8Jul 6, 2026 14:3334,721177,928,314169,131,0001,006,0002,117,632stderr
9Jul 6, 2026 14:3334,773178,197,635169,384,0001,006,0002,117,632stderr