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 20:31Victor MerckléVictor MerckléScore: 42,584Success
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 20:3242,401216,249,757206,759,0001,006,0002,117,632stderr
2Jul 5, 2026 20:3242,536216,838,760207,422,0001,005,0002,117,632stderr
3Jul 5, 2026 20:3242,565216,582,662207,568,0001,005,0002,117,632stderr
4Jul 5, 2026 20:3242,568216,816,915207,583,0001,005,0002,117,632stderr
5Jul 5, 2026 20:3242,584216,736,348207,658,0001,004,0002,117,632stderr
6Jul 5, 2026 20:3242,725217,699,685208,351,0001,004,0002,117,632stderr
7Jul 5, 2026 20:3242,770217,410,854208,571,0001,005,0002,117,632stderr
8Jul 5, 2026 20:3242,987219,272,970209,632,0001,005,0002,117,632stderr
9Jul 5, 2026 20:3243,117219,079,788209,222,0002,055,0002,117,632stderr