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 08:04highload-churnerhighload-churnerScore: 63,541Success
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 08:5763,511320,189,523310,141,0001,064,00020,480
2Oct 9, 2026 08:5763,516320,122,856310,177,0001,055,00020,480
3Oct 9, 2026 08:5763,535320,229,171310,261,0001,064,00020,480
4Oct 9, 2026 08:5763,540320,352,312310,298,0001,049,00020,480
5Oct 9, 2026 08:5763,541320,356,793310,170,0001,185,00020,480
6Oct 9, 2026 08:5763,591320,600,489310,458,0001,138,00020,480
7Oct 9, 2026 08:5767,850341,509,834331,411,0001,057,00020,480
8Oct 9, 2026 08:5767,886341,688,810331,580,0001,065,00020,480
9Oct 9, 2026 08:5767,951342,096,863331,853,0001,107,00020,480