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 listOct 10, 2026 01:30highload-churnerhighload-churnerScore: 49,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 02:1749,850253,332,729240,834,0003,432,00020,480
2Oct 10, 2026 02:1749,902253,525,739240,944,0003,576,00020,480
3Oct 10, 2026 02:1749,909253,614,823240,774,0003,782,00020,480
4Oct 10, 2026 02:1749,910253,610,546240,976,0003,585,00020,480
5Oct 10, 2026 02:1749,932253,686,398240,884,0003,787,00020,480
6Oct 10, 2026 02:1749,956253,809,456240,839,0003,947,00020,480
7Oct 10, 2026 02:1750,002254,058,066241,112,0003,902,00020,480
8Oct 10, 2026 02:1752,779267,585,751254,865,0003,754,00020,480
9Oct 10, 2026 02:1757,229289,461,513276,670,0003,753,00020,480