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 18:05Josu San MartinJosu San MartinScore: 29,927Success
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 18:0629,891156,491,446145,344,0001,125,0002,113,536
2Aug 2, 2026 18:0629,903156,755,950145,404,0001,125,0002,113,536
3Aug 2, 2026 18:0629,908156,707,456145,427,0001,125,0002,113,536
4Aug 2, 2026 18:0629,912157,176,111145,454,0001,115,0002,113,536
5Aug 2, 2026 18:0629,927156,588,112145,505,0001,138,0002,113,536
6Aug 2, 2026 18:0630,194158,733,971146,824,0001,131,0002,113,536
7Aug 2, 2026 18:0630,210158,082,844146,904,0001,127,0002,113,536
8Aug 2, 2026 18:0630,216158,853,124146,925,0001,136,0002,113,536
9Aug 2, 2026 18:0630,224158,137,217146,799,0001,302,0002,113,536