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 09:57highload-churnerhighload-churnerScore: 58,647Success
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 10:0158,398295,082,153285,102,0001,050,00020,480
2Oct 9, 2026 10:0158,418295,171,925285,183,0001,068,00020,480
3Oct 9, 2026 10:0158,494295,616,306285,564,0001,060,00020,480
4Oct 9, 2026 10:0158,646296,369,099286,231,0001,139,00020,480
5Oct 9, 2026 10:0158,647296,251,523286,288,0001,085,00020,480
6Oct 9, 2026 10:0158,735296,821,497286,788,0001,016,00020,480
7Oct 9, 2026 10:0160,127303,574,181293,570,0001,054,00020,480
8Oct 9, 2026 10:0160,176303,784,972293,817,0001,050,00020,480
9Oct 9, 2026 10:01124,252617,800,363607,784,0001,052,00020,480