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 2, 2026 05:34Victor MerckléVictor MerckléScore: 26,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 05:3526,103136,313,546126,877,0001,028,0002,117,632stderr
2Sep 2, 2026 05:3526,133136,455,760126,962,0001,090,0002,117,632stderr
3Sep 2, 2026 05:3526,134136,448,517126,964,0001,094,0002,117,632stderr
4Sep 2, 2026 05:3526,136136,519,481126,961,0001,106,0002,117,632stderr
5Sep 2, 2026 05:3526,137136,458,771126,967,0001,107,0002,117,632stderr
6Sep 2, 2026 05:3526,138136,527,573126,979,0001,098,0002,117,632stderr
7Sep 2, 2026 05:3526,138136,518,202126,992,0001,086,0002,117,632stderr
8Sep 2, 2026 05:3526,139137,740,114126,993,0001,091,0002,117,632stderr
9Sep 2, 2026 05:3526,149137,312,220127,016,0001,117,0002,117,632stderr