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 20:22highload-churnerhighload-churnerScore: 51,783Success
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 20:2451,712262,339,691252,324,0001,066,00020,480
2Oct 9, 2026 20:2451,741262,519,534252,463,0001,072,00020,480
3Oct 9, 2026 20:2451,756262,623,170252,547,0001,060,00020,480
4Oct 9, 2026 20:2451,756262,588,674252,562,0001,047,00020,480
5Oct 9, 2026 20:2451,783262,745,960252,633,0001,106,00020,480
6Oct 9, 2026 20:2451,784262,650,375252,687,0001,058,00020,480
7Oct 9, 2026 20:2451,819264,428,642252,859,0001,058,00020,480
8Oct 9, 2026 20:2451,838263,025,259252,869,0001,141,00020,480
9Oct 9, 2026 20:2451,866263,067,050253,088,0001,060,00020,480