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 18, 2026 01:31M-RochatM-RochatScore: 111,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:32111,130555,717,954542,421,0002,118,0002,113,536
2May 18, 2026 01:32111,219554,820,989542,896,0002,081,0002,113,536
3May 18, 2026 01:32111,231555,172,359543,030,0002,004,0002,113,536
4May 18, 2026 01:32111,655558,101,741545,002,0002,112,0002,113,536
5May 18, 2026 01:32111,708557,471,105545,367,0002,003,0002,113,536
6May 18, 2026 01:32111,741557,186,559545,527,0002,005,0002,113,536
7May 18, 2026 01:32111,773559,598,681545,685,0002,005,0002,113,536
8May 18, 2026 01:32114,870575,277,588560,783,0002,080,0002,113,536
9May 18, 2026 01:32114,946573,597,968561,078,0002,158,0002,113,536