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:43M-RochatM-RochatScore: 113,944Success
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:44110,615554,509,309540,898,0001,119,0002,113,536
2May 20, 2026 15:44110,772554,665,677541,638,0001,148,0002,113,536
3May 20, 2026 15:44111,069555,797,343543,119,0001,122,0002,113,536
4May 20, 2026 15:44113,911568,669,053557,033,0001,131,0002,113,536
5May 20, 2026 15:44113,944570,400,927557,186,0001,144,0002,113,536
6May 20, 2026 15:44114,265570,433,097558,771,0001,132,0002,113,536
7May 20, 2026 15:44122,915613,468,885601,149,0001,139,0002,113,536
8May 20, 2026 15:44129,013642,635,585631,040,0001,124,0002,113,536
9May 20, 2026 15:44130,076649,891,620636,218,0001,156,0002,113,536