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 02:54Victor MerckléVictor MerckléScore: 26,245Success
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 02:5526,240136,971,134127,561,0001,018,0002,117,632stderr
2Sep 2, 2026 02:5526,241137,018,838127,558,0001,027,0002,117,632stderr
3Sep 2, 2026 02:5526,244137,021,647127,575,0001,023,0002,117,632stderr
4Sep 2, 2026 02:5526,245137,071,164127,550,0001,053,0002,117,632stderr
5Sep 2, 2026 02:5526,245137,074,361127,576,0001,027,0002,117,632stderr
6Sep 2, 2026 02:5526,250137,042,258127,536,0001,089,0002,117,632stderr
7Sep 2, 2026 02:5526,258137,749,112127,534,0001,135,0002,117,632stderr
8Sep 2, 2026 02:5526,260137,461,697127,579,0001,096,0002,117,632stderr
9Sep 2, 2026 02:5526,260137,047,222127,573,0001,101,0002,117,632stderr