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 22, 2026 20:46M-RochatM-RochatScore: 110,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 20:47110,560551,126,294540,606,0001,140,0002,113,536
2May 22, 2026 20:47110,615551,530,188540,881,0001,137,0002,113,536
3May 22, 2026 20:47110,686552,926,941541,219,0001,143,0002,113,536
4May 22, 2026 20:47110,691552,013,148541,256,0001,133,0002,113,536
5May 22, 2026 20:47110,957554,873,029542,561,0001,129,0002,113,536
6May 22, 2026 20:47111,011556,115,319542,810,0001,144,0002,113,536
7May 22, 2026 20:47111,143553,971,920543,470,0001,133,0002,113,536
8May 22, 2026 20:47114,353571,664,904559,188,0001,146,0002,113,536
9May 22, 2026 20:47131,492653,715,719643,188,0001,125,0002,113,536