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:07highload-churnerhighload-churnerScore: 24,923Success
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:0824,902131,040,952120,981,0001,040,0002,113,536
2Oct 12, 2026 05:0824,904131,041,324121,016,0001,015,0002,113,536
3Oct 12, 2026 05:0824,905130,990,756121,009,0001,030,0002,113,536
4Oct 12, 2026 05:0824,906131,011,303120,935,0001,108,0002,113,536
5Oct 12, 2026 05:0824,923131,111,265121,016,0001,107,0002,113,536
6Oct 12, 2026 05:0824,943131,202,736121,099,0001,124,0002,113,536
7Oct 12, 2026 05:0824,962131,371,853121,187,0001,131,0002,113,536
8Oct 12, 2026 05:0824,985131,454,247121,336,0001,094,0002,113,536
9Oct 12, 2026 05:0825,054132,141,625121,659,0001,109,0002,113,536