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 listAug 25, 2026 04:29Victor MerckléVictor MerckléScore: 28,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 04:3028,030146,450,216135,334,0002,014,0002,117,632stderr
2Aug 25, 2026 04:3028,054145,833,375136,458,0001,009,0002,117,632stderr
3Aug 25, 2026 04:3028,069145,928,897136,532,0001,009,0002,117,632stderr
4Aug 25, 2026 04:3028,103146,172,824135,693,0002,012,0002,117,632stderr
5Aug 25, 2026 04:3028,121146,256,135135,760,0002,036,0002,117,632stderr
6Aug 25, 2026 04:3028,161146,361,685136,979,0001,010,0002,117,632stderr
7Aug 25, 2026 04:3028,182148,533,382137,085,0001,010,0002,117,632stderr
8Aug 25, 2026 04:3028,231146,730,210136,289,0002,043,0002,117,632stderr
9Aug 25, 2026 04:3028,250147,516,782137,418,0001,011,0002,117,632stderr