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:39anboto1anboto1Score: 57,760Success
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:4157,561290,512,717280,874,0001,176,0002,113,536
2Aug 3, 2026 20:4157,563290,565,889280,944,0001,119,0002,113,536
3Aug 3, 2026 20:4157,568290,259,532280,975,0001,110,0002,113,536
4Aug 3, 2026 20:4157,717291,268,420281,683,0001,131,0002,113,536
5Aug 3, 2026 20:4157,760291,494,943281,806,0001,219,0002,113,536
6Aug 3, 2026 20:4157,764291,640,345281,841,0001,207,0002,113,536
7Aug 3, 2026 20:4157,824291,844,268282,302,0001,039,0002,113,536
8Aug 3, 2026 20:4158,206293,643,132284,040,0001,173,0002,113,536
9Aug 3, 2026 20:4158,710295,914,011286,634,0001,047,0002,113,536