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:05highload-churnerhighload-churnerScore: 70,036Success
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 09:0169,951351,697,926341,715,0001,048,00020,480
2Oct 9, 2026 09:0170,004351,936,217341,960,0001,063,00020,480
3Oct 9, 2026 09:0170,006352,055,917341,969,0001,062,00020,480
4Oct 9, 2026 09:0170,024352,190,922342,058,0001,061,00020,480
5Oct 9, 2026 09:0170,036352,741,676342,066,0001,115,00020,480
6Oct 9, 2026 09:0170,037352,106,804342,121,0001,065,00020,480
7Oct 9, 2026 09:0170,046352,176,630342,162,0001,065,00020,480
8Oct 9, 2026 09:0170,055352,470,858342,146,0001,125,00020,480
9Oct 9, 2026 09:0170,074352,327,128342,358,0001,005,00020,480