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 listSep 3, 2026 23:15Victor MerckléVictor MerckléScore: 25,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 23:1525,574133,787,351124,290,0001,026,0002,117,632stderr
2Sep 3, 2026 23:1525,594133,887,516124,310,0001,102,0002,117,632stderr
3Sep 3, 2026 23:1525,600135,011,809124,329,0001,111,0002,117,632stderr
4Sep 3, 2026 23:1525,608133,952,679124,388,0001,094,0002,117,632stderr
5Sep 3, 2026 23:1525,608133,956,955124,386,0001,098,0002,117,632stderr
6Sep 3, 2026 23:1525,617133,992,555124,425,0001,101,0002,117,632stderr
7Sep 3, 2026 23:1525,617133,955,988124,426,0001,098,0002,117,632stderr
8Sep 3, 2026 23:1525,620134,096,134124,437,0001,104,0002,117,632stderr
9Sep 3, 2026 23:1525,630134,049,831124,490,0001,101,0002,117,632stderr