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 17, 2026 04:58M-RochatM-RochatScore: 125,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 04:59125,516625,848,892613,942,0001,090,0002,113,536
2May 17, 2026 04:59125,545624,706,632614,035,0001,137,0002,113,536
3May 17, 2026 04:59125,713626,624,815614,828,0001,167,0002,113,536
4May 17, 2026 04:59125,886627,580,163615,751,0001,093,0002,113,536
5May 17, 2026 04:59125,972626,780,104616,110,0001,156,0002,113,536
6May 17, 2026 04:59125,980627,016,508616,198,0001,106,0002,113,536
7May 17, 2026 04:59127,082632,836,710621,553,0001,152,0002,113,536
8May 17, 2026 04:59128,286638,427,969627,453,0001,149,0002,113,536
9May 17, 2026 04:59128,762639,712,655629,835,0001,103,0002,113,536