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 12, 2026 05:06highload-churnerhighload-churnerScore: 25,006Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 05:0624,924131,073,070121,091,0001,039,0002,113,536
2Oct 12, 2026 05:0624,943131,191,630121,104,0001,119,0002,113,536
3Oct 12, 2026 05:0624,971131,296,423121,333,0001,027,0002,113,536
4Oct 12, 2026 05:0624,983131,377,549121,258,0001,161,0002,113,536
5Oct 12, 2026 05:0625,006131,508,341121,503,0001,030,0002,113,536
6Oct 12, 2026 05:0625,026131,640,048121,587,0001,042,0002,113,536
7Oct 12, 2026 05:0625,056131,800,886121,744,0001,035,0002,113,536
8Oct 12, 2026 05:0625,094131,954,660121,921,0001,041,0002,113,536
9Oct 12, 2026 05:0625,128132,156,825122,029,0001,102,0002,113,536