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:29highload-churnerhighload-churnerScore: 50,122Success
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:1550,013254,077,714241,517,0003,547,00020,480
2Oct 10, 2026 02:1550,043254,232,203241,494,0003,721,00020,480
3Oct 10, 2026 02:1550,072254,442,455241,805,0003,549,00020,480
4Oct 10, 2026 02:1550,104254,584,959241,916,0003,597,00020,480
5Oct 10, 2026 02:1550,122254,705,899241,755,0003,844,00020,480
6Oct 10, 2026 02:1550,124254,682,393241,883,0003,728,00020,480
7Oct 10, 2026 02:1550,124254,639,910241,791,0003,819,00020,480
8Oct 10, 2026 02:1550,154254,845,629241,758,0003,997,00020,480
9Oct 10, 2026 02:1550,213255,004,902242,284,0003,762,00020,480