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 12:16Josu San MartinJosu San MartinScore: 25,477Success
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 12:1625,424133,007,926123,322,0001,259,0002,113,536
2Aug 4, 2026 12:1625,453134,432,664123,715,0001,005,0002,113,536
3Aug 4, 2026 12:1625,466133,007,610123,523,0001,264,0002,113,536
4Aug 4, 2026 12:1625,474134,632,111123,565,0001,260,0002,113,536
5Aug 4, 2026 12:1625,477133,212,080123,575,0001,267,0002,113,536
6Aug 4, 2026 12:1625,519133,614,115123,770,0001,275,0002,113,536
7Aug 4, 2026 12:1625,567134,391,404124,267,0001,015,0002,113,536
8Aug 4, 2026 12:1625,760135,302,624124,954,0001,271,0002,113,536
9Aug 4, 2026 12:1625,791137,576,006125,101,0001,276,0002,113,536