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:32M-RochatM-RochatScore: 112,434Success
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:35110,615551,667,594540,919,0001,095,0002,113,536
2May 20, 2026 15:35110,709554,775,429541,390,0001,086,0002,113,536
3May 20, 2026 15:35110,962553,868,891542,627,0001,089,0002,113,536
4May 20, 2026 15:35111,925557,952,351547,336,0001,100,0002,113,536
5May 20, 2026 15:35112,434561,051,396549,825,0001,105,0002,113,536
6May 20, 2026 15:35112,927564,184,005552,262,0001,083,0002,113,536
7May 20, 2026 15:35112,975564,670,510552,483,0001,095,0002,113,536
8May 20, 2026 15:35113,336566,639,059554,257,0001,094,0002,113,536
9May 20, 2026 15:35113,361566,898,509554,378,0001,093,0002,113,536