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:28anboto1anboto1Score: 59,645Success
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:3059,584300,370,306290,848,0001,116,0002,113,536
2Aug 3, 2026 20:3059,600300,504,867290,893,0001,148,0002,113,536
3Aug 3, 2026 20:3059,612300,492,734290,941,0001,158,0002,113,536
4Aug 3, 2026 20:3059,618300,443,429291,025,0001,108,0002,113,536
5Aug 3, 2026 20:3059,645300,673,930291,142,0001,121,0002,113,536
6Aug 3, 2026 20:3059,878301,835,565292,211,0001,194,0002,113,536
7Aug 3, 2026 20:3060,239303,767,607294,056,0001,118,0002,113,536
8Aug 3, 2026 20:3060,243303,794,594294,086,0001,107,0002,113,536
9Aug 3, 2026 20:3060,555305,138,749295,712,0001,009,0002,113,536