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 06:00Victor MerckléVictor MerckléScore: 27,945Success
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 06:0027,929145,223,817135,844,0001,009,0002,117,632stderr
2Aug 25, 2026 06:0027,930145,231,881134,845,0002,015,0002,117,632stderr
3Aug 25, 2026 06:0027,933145,309,332134,858,0002,014,0002,117,632stderr
4Aug 25, 2026 06:0027,942145,272,933135,908,0001,010,0002,117,632stderr
5Aug 25, 2026 06:0027,945145,276,352134,929,0002,005,0002,117,632stderr
6Aug 25, 2026 06:0027,953145,386,922134,958,0002,012,0002,117,632stderr
7Aug 25, 2026 06:0027,962145,477,801135,010,0002,007,0002,117,632stderr
8Aug 25, 2026 06:0027,964145,402,283135,014,0002,010,0002,117,632stderr
9Aug 25, 2026 06:0027,966145,467,793135,030,0002,008,0002,117,632stderr