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:46M-RochatM-RochatScore: 113,872Success
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:47110,536553,822,964540,473,0001,158,0002,113,536
2May 20, 2026 15:47110,575551,161,675540,704,0001,117,0002,113,536
3May 20, 2026 15:47110,623553,815,330540,919,0001,138,0002,113,536
4May 20, 2026 15:47111,091555,302,888543,220,0001,129,0002,113,536
5May 20, 2026 15:47113,872569,721,074556,836,0001,138,0002,113,536
6May 20, 2026 15:47114,358572,105,133559,238,0001,119,0002,113,536
7May 20, 2026 15:47114,374569,996,765559,302,0001,131,0002,113,536
8May 20, 2026 15:47115,854578,153,772566,536,0001,152,0002,113,536
9May 20, 2026 15:47153,677765,710,158751,892,0001,129,0002,113,536