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 00:22M-RochatM-RochatScore: 143,381Success
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 00:25142,938709,446,643699,393,0001,007,0002,113,536
2May 17, 2026 00:25142,967710,392,999699,377,0001,165,0002,113,536
3May 17, 2026 00:25143,211710,634,128700,585,0001,152,0002,113,536
4May 17, 2026 00:25143,379711,587,588701,479,0001,080,0002,113,536
5May 17, 2026 00:25143,381713,155,076701,456,0001,112,0002,113,536
6May 17, 2026 00:25143,579712,392,425702,451,0001,089,0002,113,536
7May 17, 2026 00:25143,728714,225,079703,198,0001,073,0002,113,536
8May 17, 2026 00:25144,993720,135,526709,360,0001,110,0002,113,536
9May 17, 2026 00:25148,799739,785,987727,937,0001,181,0002,113,536