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 2, 2026 16:11Josu San MartinJosu San MartinScore: 30,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 16:1230,194158,739,849146,826,0001,125,0002,113,536
2Aug 2, 2026 16:1230,204158,864,167146,871,0001,132,0002,113,536
3Aug 2, 2026 16:1230,209158,037,386146,911,0001,117,0002,113,536
4Aug 2, 2026 16:1230,209158,100,194146,908,0001,120,0002,113,536
5Aug 2, 2026 16:1230,211159,497,982146,916,0001,122,0002,113,536
6Aug 2, 2026 16:1230,215158,838,278146,925,0001,129,0002,113,536
7Aug 2, 2026 16:1230,234158,206,266147,024,0001,126,0002,113,536
8Aug 2, 2026 16:1230,462159,975,061148,116,0001,149,0002,113,536
9Aug 2, 2026 16:1230,691160,515,423149,278,0001,112,0002,113,536