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 13, 2025 00:20zielajzielajScore: 45,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2025 00:2045,922253,465,365224,020,0001,000,0002,449,408
2Jul 13, 2025 00:2045,944250,992,056223,123,0002,001,0002,310,144
3Jul 13, 2025 00:2045,944251,962,698223,124,0002,001,0002,461,696
4Jul 13, 2025 00:2045,949249,061,977225,152,00002,330,624
5Jul 13, 2025 00:2045,950245,620,913223,152,0002,001,0002,314,240
6Jul 13, 2025 00:2045,958252,717,427225,196,00002,453,504
7Jul 13, 2025 00:2045,972246,894,931224,263,0001,001,0002,310,144
8Jul 13, 2025 00:2046,014258,179,204224,470,000997,0002,322,432
9Jul 13, 2025 00:2046,535252,634,040227,022,0001,000,0002,314,240