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 17:12Josu San MartinJosu San MartinScore: 27,521Success
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 17:1227,435143,550,001133,178,0001,255,0002,113,536
2Aug 3, 2026 17:1227,483143,684,976133,395,0001,272,0002,113,536
3Aug 3, 2026 17:1227,499143,112,797133,481,0001,267,0002,113,536
4Aug 3, 2026 17:1227,516143,942,586133,560,0001,270,0002,113,536
5Aug 3, 2026 17:1227,521143,520,850133,591,0001,265,0002,113,536
6Aug 3, 2026 17:1227,527143,317,736133,862,0001,023,0002,113,536
7Aug 3, 2026 17:1227,608144,055,722134,021,0001,261,0002,113,536
8Aug 3, 2026 17:1227,768145,850,996135,051,0001,016,0002,113,536
9Aug 3, 2026 17:1228,788150,115,021140,061,0001,005,0002,113,536