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:51M-RochatM-RochatScore: 111,057Success
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:53110,493553,515,422540,281,0001,137,0002,113,536
2May 20, 2026 15:53110,553553,728,898540,567,0001,144,0002,113,536
3May 20, 2026 15:53110,575552,397,931540,686,0001,132,0002,113,536
4May 20, 2026 15:53110,690566,844,616541,218,0001,165,0002,113,536
5May 20, 2026 15:53111,057555,959,797543,048,0001,134,0002,113,536
6May 20, 2026 15:53114,115569,119,515558,034,0001,131,0002,113,536
7May 20, 2026 15:53114,162571,635,823558,262,0001,133,0002,113,536
8May 20, 2026 15:53114,241571,452,768558,662,0001,123,0002,113,536
9May 20, 2026 15:53153,738765,868,790752,187,0001,134,0002,113,536