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 18:55highload-churnerhighload-churnerScore: 72,388Success
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 18:5672,271363,100,557246,183,000107,945,00020,480
2Oct 9, 2026 18:5672,322363,337,369246,792,000107,587,00020,480
3Oct 9, 2026 18:5672,360364,801,175246,730,000107,838,00020,480
4Oct 9, 2026 18:5672,375363,649,475246,659,000107,981,00020,480
5Oct 9, 2026 18:5672,388363,709,054246,104,000108,600,00020,480
6Oct 9, 2026 18:5672,394363,653,163247,042,000107,690,00020,480
7Oct 9, 2026 18:5672,494364,230,404246,745,000108,476,00020,480
8Oct 9, 2026 18:5672,511370,881,624246,807,000108,500,00020,480
9Oct 9, 2026 18:5673,882371,333,276253,508,000108,516,00020,480