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 listAug 3, 2026 20:06anboto1anboto1Score: 63,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:0763,787320,738,057311,542,0001,016,0002,113,536
2Aug 3, 2026 20:0763,794321,502,547311,555,0001,036,0002,113,536
3Aug 3, 2026 20:0763,858321,548,641311,870,0001,037,0002,113,536
4Aug 3, 2026 20:0763,880321,471,176311,983,0001,031,0002,113,536
5Aug 3, 2026 20:0763,894321,516,486312,053,0001,029,0002,113,536
6Aug 3, 2026 20:0763,917321,579,351312,178,0001,019,0002,113,536
7Aug 3, 2026 20:0763,972321,941,679312,384,0001,083,0002,113,536
8Aug 3, 2026 20:0764,123323,197,552313,164,0001,039,0002,113,536
9Aug 3, 2026 20:0764,497324,519,360314,951,0001,087,0002,113,536