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 3, 2026 21:32anboto1anboto1Score: 58,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 21:3357,537290,992,333280,828,0001,105,0002,113,536
2Aug 3, 2026 21:3357,586290,785,035281,079,0001,096,0002,113,536
3Aug 3, 2026 21:3357,669291,635,823281,362,0001,220,0002,113,536
4Aug 3, 2026 21:3357,707291,890,967281,600,0001,168,0002,113,536
5Aug 3, 2026 21:3358,030293,456,051283,259,0001,091,0002,113,536
6Aug 3, 2026 21:3358,031293,508,833283,222,0001,132,0002,113,536
7Aug 3, 2026 21:3358,173293,644,966283,961,0001,089,0002,113,536
8Aug 3, 2026 21:3358,643295,717,418286,342,0001,010,0002,113,536
9Aug 3, 2026 21:3358,828298,770,160287,236,0001,024,0002,113,536