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 16, 2026 15:51M-RochatM-RochatScore: 447,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 15:52446,2402,195,778,4432,184,574,0002,003,0002,113,536
2May 16, 2026 15:52446,8682,200,613,3192,187,654,0002,003,0002,113,536
3May 16, 2026 15:52446,9152,201,431,7962,187,765,0002,121,0002,113,536
4May 16, 2026 15:52447,5232,203,527,6442,190,777,0002,090,0002,113,536
5May 16, 2026 15:52447,5842,203,928,7482,190,121,0003,045,0002,113,536
6May 16, 2026 15:52449,1052,211,240,1212,198,612,0002,003,0002,113,536
7May 16, 2026 15:52453,3102,232,112,8682,218,195,0003,026,0002,113,536
8May 16, 2026 15:52454,7872,240,077,3332,225,291,0003,166,0002,113,536
9May 16, 2026 15:52456,1172,245,568,2882,231,892,0003,082,0002,113,536