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 22:32Victor MerckléVictor MerckléScore: 25,263Success
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 22:3225,221131,987,702122,570,0001,015,0002,117,632stderr
2Sep 3, 2026 22:3225,224132,062,068122,548,0001,054,0002,117,632stderr
3Sep 3, 2026 22:3225,235132,080,178122,623,0001,030,0002,117,632stderr
4Sep 3, 2026 22:3225,260132,213,838122,669,0001,109,0002,117,632stderr
5Sep 3, 2026 22:3225,263132,299,691122,699,0001,093,0002,117,632stderr
6Sep 3, 2026 22:3225,271132,491,583122,725,0001,104,0002,117,632stderr
7Sep 3, 2026 22:3225,276132,343,833122,689,0001,165,0002,117,632stderr
8Sep 3, 2026 22:3225,278132,338,455122,767,0001,099,0002,117,632stderr
9Sep 3, 2026 22:3225,288132,325,023122,804,0001,109,0002,117,632stderr