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 13, 2026 07:53highload-churnerhighload-churnerScore: 22,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 07:5422,615119,776,201109,750,0001,064,00020,480
2Oct 13, 2026 07:5422,616119,791,888109,755,0001,065,00020,480
3Oct 13, 2026 07:5422,617119,839,059109,757,0001,071,00020,480
4Oct 13, 2026 07:5422,621119,854,126109,784,0001,059,00020,480
5Oct 13, 2026 07:5422,622119,934,726109,763,0001,089,00020,480
6Oct 13, 2026 07:5422,624119,920,240109,795,0001,064,00020,480
7Oct 13, 2026 07:5422,626121,435,547109,793,0001,076,00020,480
8Oct 13, 2026 07:5422,629119,898,857109,815,0001,069,00020,480
9Oct 13, 2026 07:5422,629119,946,482109,766,0001,119,00020,480