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 listDec 22, 2025 15:06Josu San MartinJosu San MartinScore: 245,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 15:06244,7761,225,317,8571,196,402,0002,998,0002,420,736
2Dec 22, 2025 15:06245,0191,229,667,4181,197,593,0002,998,0002,289,664
3Dec 22, 2025 15:06245,1931,230,279,7531,196,451,0004,997,0002,494,464
4Dec 22, 2025 15:06245,4631,228,430,4711,198,770,0003,999,0002,289,664
5Dec 22, 2025 15:06245,5461,228,088,7321,197,178,0005,995,0002,412,544
6Dec 22, 2025 15:06245,7961,234,149,2691,202,402,0001,999,0002,289,664
7Dec 22, 2025 15:06248,2071,244,784,2051,212,215,0003,997,0002,502,656
8Dec 22, 2025 15:06255,5631,281,101,0491,249,263,0002,998,0002,314,240
9Dec 22, 2025 15:06256,6161,287,790,0491,255,417,0001,999,0002,289,664