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 20:31anboto1anboto1Score: 57,631Success
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 20:3357,585290,800,192280,958,0001,211,0002,113,536
2Aug 3, 2026 20:3357,591290,660,733281,137,0001,061,0002,113,536
3Aug 3, 2026 20:3357,616290,510,494281,216,0001,107,0002,113,536
4Aug 3, 2026 20:3357,626292,092,114281,250,0001,119,0002,113,536
5Aug 3, 2026 20:3357,631290,855,505281,189,0001,205,0002,113,536
6Aug 3, 2026 20:3357,636291,541,766281,286,0001,131,0002,113,536
7Aug 3, 2026 20:3357,707291,975,015281,619,0001,148,0002,113,536
8Aug 3, 2026 20:3358,498301,526,040285,513,0001,130,0002,113,536
9Aug 3, 2026 20:3359,054297,814,844288,136,0001,231,0002,113,536