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 listSep 23, 2026 17:25Kevin HeaveyKevin HeaveyScore: 25,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 17:2625,900138,102,381125,793,0001,120,00020,480
2Sep 23, 2026 17:2625,900137,967,607125,798,0001,113,00020,480
3Sep 23, 2026 17:2625,901137,263,210125,798,0001,117,00020,480
4Sep 23, 2026 17:2625,908138,177,577125,835,0001,118,00020,480
5Sep 23, 2026 17:2625,912137,368,412125,873,0001,099,00020,480
6Sep 23, 2026 17:2625,916138,196,663125,866,0001,127,00020,480
7Sep 23, 2026 17:2625,918137,311,761125,891,0001,108,00020,480
8Sep 23, 2026 17:2625,926138,629,574125,909,0001,132,00020,480
9Sep 23, 2026 17:2625,959137,581,549126,068,0001,135,00020,480