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:44M-RochatM-RochatScore: 111,079Success
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:45110,563552,906,086540,627,0001,132,0002,113,536
2May 20, 2026 15:45110,591553,922,632540,755,0001,141,0002,113,536
3May 20, 2026 15:45110,647552,175,996541,039,0001,133,0002,113,536
4May 20, 2026 15:45110,720558,658,841541,379,0001,150,0002,113,536
5May 20, 2026 15:45111,079554,680,572543,168,0001,123,0002,113,536
6May 20, 2026 15:45111,102554,340,603543,255,0001,148,0002,113,536
7May 20, 2026 15:45114,425572,757,472559,531,0001,154,0002,113,536
8May 20, 2026 15:45115,907579,217,940566,814,0001,132,0002,113,536
9May 20, 2026 15:45140,528700,328,898687,443,0001,148,0002,113,536