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: 61,065Success
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:5260,975307,791,462297,675,0001,104,00020,480
2Oct 9, 2026 08:5260,986307,924,649297,763,0001,073,00020,480
3Oct 9, 2026 08:5261,030308,039,483297,966,0001,081,00020,480
4Oct 9, 2026 08:5261,044308,233,205297,951,0001,169,00020,480
5Oct 9, 2026 08:5261,065317,665,039298,077,0001,144,00020,480
6Oct 9, 2026 08:5262,722316,285,076306,240,0001,101,00020,480
7Oct 9, 2026 08:5262,730323,089,759306,293,0001,086,00020,480
8Oct 9, 2026 08:5262,740316,362,903306,420,0001,007,00020,480
9Oct 9, 2026 08:5262,817331,506,853306,620,0001,186,00020,480