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:31M-RochatM-RochatScore: 114,273Success
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:32110,524551,822,775540,433,0001,136,0002,113,536
2May 20, 2026 15:32110,809553,264,550541,814,0001,151,0002,113,536
3May 20, 2026 15:32110,862554,707,472542,108,0001,117,0002,113,536
4May 20, 2026 15:32113,816567,704,800556,570,0001,129,0002,113,536
5May 20, 2026 15:32114,273571,057,397558,819,0001,120,0002,113,536
6May 20, 2026 15:32114,509571,756,423559,962,0001,134,0002,113,536
7May 20, 2026 15:32122,936613,596,732601,265,0001,124,0002,113,536
8May 20, 2026 15:32130,972651,111,249640,640,0001,123,0002,113,536
9May 20, 2026 15:32131,017652,666,864640,851,0001,137,0002,113,536