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 9, 2026 07:32highload-churnerhighload-churnerScore: 105,571Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 07:44103,886520,856,732507,942,0001,101,00020,480
2Oct 9, 2026 07:44104,157519,391,050509,244,0001,126,00020,480
3Oct 9, 2026 07:44104,315520,150,826510,008,0001,138,00020,480
4Oct 9, 2026 07:44104,446520,777,686510,682,0001,108,00020,480
5Oct 9, 2026 07:44105,571526,246,997516,197,0001,104,00020,480
6Oct 9, 2026 07:44105,623536,800,709516,448,0001,108,00020,480
7Oct 9, 2026 07:44105,634535,341,996516,450,0001,161,00020,480
8Oct 9, 2026 07:44105,653534,668,250516,615,0001,087,00020,480
9Oct 9, 2026 07:44105,674535,591,213516,681,0001,124,00020,480