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 00:52highload-churnerhighload-churnerScore: 49,382Success
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:1449,327250,684,662238,265,0003,440,00020,480
2Oct 10, 2026 02:1449,357250,911,373238,341,0003,513,00020,480
3Oct 10, 2026 02:1449,361250,877,244238,326,0003,547,00020,480
4Oct 10, 2026 02:1449,362250,883,836238,290,0003,585,00020,480
5Oct 10, 2026 02:1449,382250,941,795238,204,0003,770,00020,480
6Oct 10, 2026 02:1449,393251,060,773238,616,0003,411,00020,480
7Oct 10, 2026 02:1449,412251,013,769238,521,0003,602,00020,480
8Oct 10, 2026 02:1449,452251,426,936238,330,0003,989,00020,480
9Oct 10, 2026 02:1449,512251,672,012238,858,0003,755,00020,480