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:30anboto1anboto1Score: 57,724Success
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:3157,599290,704,794281,217,0001,022,0002,113,536
2Aug 3, 2026 20:3157,621292,236,079281,176,0001,167,0002,113,536
3Aug 3, 2026 20:3157,677291,059,675281,509,0001,113,0002,113,536
4Aug 3, 2026 20:3157,690290,913,619281,570,0001,113,0002,113,536
5Aug 3, 2026 20:3157,724291,272,941281,818,0001,031,0002,113,536
6Aug 3, 2026 20:3157,734291,376,133281,735,0001,165,0002,113,536
7Aug 3, 2026 20:3157,879292,165,993282,506,0001,102,0002,113,536
8Aug 3, 2026 20:3158,259294,565,138284,433,0001,040,0002,113,536
9Aug 3, 2026 20:3159,191298,440,607288,933,0001,105,0002,113,536