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 11, 2026 10:41wnwnScore: 98,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 10:4398,422495,386,613480,200,0002,068,0002,113,536
2May 11, 2026 10:4398,442491,819,133481,363,0001,004,0002,113,536
3May 11, 2026 10:4398,454491,965,846480,422,0002,006,0002,113,536
4May 11, 2026 10:4398,483491,248,395480,524,0002,044,0002,113,536
5May 11, 2026 10:4398,543493,577,772480,817,0002,047,0002,113,536
6May 11, 2026 10:4399,004495,792,795483,098,0002,024,0002,113,536
7May 11, 2026 10:4399,010494,696,835483,147,0002,005,0002,113,536
8May 11, 2026 10:4399,093495,544,215483,517,0002,042,0002,113,536
9May 11, 2026 10:4399,210495,826,764484,100,0002,030,0002,113,536