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 07:42highload-churnerhighload-churnerScore: 80,895Success
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 07:5475,842380,587,194370,581,0001,049,00020,480
2Oct 9, 2026 07:5475,843380,515,618370,577,0001,054,00020,480
3Oct 9, 2026 07:5475,941381,649,432371,036,0001,077,00020,480
4Oct 9, 2026 07:5480,150401,736,821391,589,0001,149,00020,480
5Oct 9, 2026 07:5480,895405,579,308395,270,0001,116,00020,480
6Oct 9, 2026 07:5480,896405,457,693395,323,0001,072,00020,480
7Oct 9, 2026 07:5480,907405,495,928395,319,0001,127,00020,480
8Oct 9, 2026 07:5480,920405,424,355395,371,0001,137,00020,480
9Oct 9, 2026 07:5480,924405,475,920395,472,0001,058,00020,480