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 18, 2026 01:31M-RochatM-RochatScore: 111,103Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:33110,519554,397,348540,384,0001,161,0002,113,536
2May 18, 2026 01:33110,542553,680,181540,515,0001,143,0002,113,536
3May 18, 2026 01:33110,686553,527,660541,209,0001,157,0002,113,536
4May 18, 2026 01:33110,965578,537,289542,478,0001,251,0002,113,536
5May 18, 2026 01:33111,103553,933,662543,270,0001,139,0002,113,536
6May 18, 2026 01:33111,125555,267,667543,383,0001,130,0002,113,536
7May 18, 2026 01:33112,907564,787,874552,120,0001,129,0002,113,536
8May 18, 2026 01:33114,505574,147,424559,942,0001,136,0002,113,536
9May 18, 2026 01:33122,935612,703,839601,238,0001,147,0002,113,536