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:53M-RochatM-RochatScore: 112,410Success
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:55110,563551,679,300540,620,0001,140,0002,113,536
2May 20, 2026 15:55110,677553,663,460541,200,0001,122,0002,113,536
3May 20, 2026 15:55110,680553,580,994541,189,0001,147,0002,113,536
4May 20, 2026 15:55111,130555,901,743543,409,0001,132,0002,113,536
5May 20, 2026 15:55112,410560,515,068549,681,0001,129,0002,113,536
6May 20, 2026 15:55113,960568,455,913557,286,0001,118,0002,113,536
7May 20, 2026 15:55113,995568,271,378557,451,0001,127,0002,113,536
8May 20, 2026 15:55114,302570,864,970558,962,0001,121,0002,113,536
9May 20, 2026 15:55140,781700,200,124688,574,0001,256,0002,113,536