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 11, 2026 13:38highload-churnerhighload-churnerScore: 28,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2026 13:3828,221147,291,177137,264,0001,021,0002,113,536
2Oct 11, 2026 13:3828,234147,353,257137,250,0001,101,0002,113,536
3Oct 11, 2026 13:3828,271148,934,613137,427,0001,104,0002,113,536
4Oct 11, 2026 13:3828,298147,681,113137,572,0001,091,0002,113,536
5Oct 11, 2026 13:3828,338147,893,125137,731,0001,126,0002,113,536
6Oct 11, 2026 13:3828,343147,945,074137,773,0001,111,0002,113,536
7Oct 11, 2026 13:3828,545148,897,214138,775,0001,096,0002,113,536
8Oct 11, 2026 13:3828,562148,992,521138,855,0001,101,0002,113,536
9Oct 11, 2026 13:3828,563149,011,395138,816,0001,145,0002,113,536