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 15:41Victor MerckléVictor MerckléScore: 27,265Success
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 15:4227,189141,609,770132,211,0001,019,0002,117,632stderr
2Aug 25, 2026 15:4227,195141,599,372132,240,0001,020,0002,117,632stderr
3Aug 25, 2026 15:4227,221141,800,655132,356,0001,029,0002,117,632stderr
4Aug 25, 2026 15:4227,239141,841,138132,378,0001,094,0002,117,632stderr
5Aug 25, 2026 15:4227,265141,965,563132,498,0001,102,0002,117,632stderr
6Aug 25, 2026 15:4227,269141,968,204132,521,0001,098,0002,117,632stderr
7Aug 25, 2026 15:4227,272142,483,247132,541,0001,096,0002,117,632stderr
8Aug 25, 2026 15:4227,289142,118,916132,608,0001,110,0002,117,632stderr
9Aug 25, 2026 15:4227,312142,225,757132,722,0001,109,0002,117,632stderr