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 01:48Victor MerckléVictor MerckléScore: 28,999Success
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 01:4828,904150,031,279139,592,0002,041,0002,117,632stderr
2Aug 25, 2026 01:4828,907150,037,019139,570,0002,078,0002,117,632stderr
3Aug 25, 2026 01:4828,908150,163,358139,647,0002,007,0002,117,632stderr
4Aug 25, 2026 01:4828,957150,305,805139,852,0002,042,0002,117,632stderr
5Aug 25, 2026 01:4828,999150,561,890140,048,0002,051,0002,117,632stderr
6Aug 25, 2026 01:4829,036150,674,956140,257,0002,021,0002,117,632stderr
7Aug 25, 2026 01:4829,212161,395,046140,962,0002,181,0002,117,632stderr
8Aug 25, 2026 01:4829,217151,591,698142,157,0001,009,0002,117,632stderr
9Aug 25, 2026 01:4829,288151,972,324141,466,0002,047,0002,117,632stderr