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 4, 2026 15:02Josu San MartinJosu San MartinScore: 25,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 15:0325,214131,966,443122,284,0001,266,0002,113,536
2Aug 4, 2026 15:0325,227131,995,234122,436,0001,179,0002,113,536
3Aug 4, 2026 15:0325,264132,199,076122,611,0001,184,0002,113,536
4Aug 4, 2026 15:0325,272133,253,068122,807,0001,026,0002,113,536
5Aug 4, 2026 15:0325,273132,088,139122,566,0001,272,0002,113,536
6Aug 4, 2026 15:0325,291132,365,466122,661,0001,265,0002,113,536
7Aug 4, 2026 15:0325,294132,372,603122,758,0001,184,0002,113,536
8Aug 4, 2026 15:0325,343133,386,213122,925,0001,256,0002,113,536
9Aug 4, 2026 15:0325,425133,163,408123,575,0001,009,0002,113,536