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:39M-RochatM-RochatScore: 113,219Success
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:39112,057558,675,017547,952,0001,132,0002,113,536
2May 20, 2026 15:39112,202561,729,345548,664,0001,126,0002,113,536
3May 20, 2026 15:39112,226562,222,865548,781,0001,127,0002,113,536
4May 20, 2026 15:39112,452576,078,874549,846,0001,170,0002,113,536
5May 20, 2026 15:39113,219566,186,676553,650,0001,125,0002,113,536
6May 20, 2026 15:39113,333564,768,004554,203,0001,131,0002,113,536
7May 20, 2026 15:39113,470566,800,946554,863,0001,144,0002,113,536
8May 20, 2026 15:39116,046579,001,995567,500,0001,126,0002,113,536
9May 20, 2026 15:39116,512580,565,475569,785,0001,126,0002,113,536