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 listMay 20, 2026 15:52M-RochatM-RochatScore: 113,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 15:54110,467554,511,029540,146,0001,143,0002,113,536
2May 20, 2026 15:54110,511554,164,300540,386,0001,120,0002,113,536
3May 20, 2026 15:54110,520553,368,162540,403,0001,145,0002,113,536
4May 20, 2026 15:54113,736568,197,601556,178,0001,133,0002,113,536
5May 20, 2026 15:54113,770569,302,755556,336,0001,138,0002,113,536
6May 20, 2026 15:54114,159571,386,820558,239,0001,141,0002,113,536
7May 20, 2026 15:54133,728665,127,988654,129,0001,140,0002,113,536
8May 20, 2026 15:54134,668670,558,226658,718,0001,158,0002,113,536
9May 20, 2026 15:54150,183747,425,186734,753,0001,145,0002,113,536