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 listJul 27, 2025 16:19zielajzielajScore: 25,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2025 16:1924,997145,954,326122,483,00002,330,624
2Jul 27, 2025 16:2125,024143,263,100121,622,000996,0002,469,888
3Jul 27, 2025 16:2125,039150,921,120121,694,000997,0002,461,696
4Jul 27, 2025 16:1925,045154,853,891120,726,0001,995,0002,310,144
5Jul 27, 2025 16:2125,050149,486,478120,751,0001,995,0002,310,144
6Jul 27, 2025 16:1926,817158,596,630130,402,0001,003,0002,441,216