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 5, 2026 18:15Victor MerckléVictor MerckléScore: 53,931Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 18:1653,319269,170,412260,258,0001,007,0002,117,632stderr
2Jul 5, 2026 18:1653,522270,079,674261,253,0001,008,0002,117,632stderr
3Jul 5, 2026 18:1653,572270,355,222261,496,0001,007,0002,117,632stderr
4Jul 5, 2026 18:1653,917272,048,358263,186,0001,008,0002,117,632stderr
5Jul 5, 2026 18:1653,931272,100,960263,260,0001,006,0002,117,632stderr
6Jul 5, 2026 18:1653,934272,363,873263,269,0001,008,0002,117,632stderr
7Jul 5, 2026 18:1654,011272,494,073263,649,0001,007,0002,117,632stderr
8Jul 5, 2026 18:1654,216273,555,800264,653,0001,007,0002,117,632stderr
9Jul 5, 2026 18:1654,271273,855,510263,921,0002,011,0002,117,632stderr