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:57highload-churnerhighload-churnerScore: 69,551Success
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 08:2068,944347,363,278336,766,0001,060,00020,480
2Oct 9, 2026 08:2068,947346,907,784336,779,0001,062,00020,480
3Oct 9, 2026 08:2068,959346,948,492336,810,0001,092,00020,480
4Oct 9, 2026 08:2068,993347,080,574336,915,0001,151,00020,480
5Oct 9, 2026 08:2069,551349,788,942339,730,0001,071,00020,480
6Oct 9, 2026 08:2069,592350,005,863339,934,0001,070,00020,480
7Oct 9, 2026 08:2069,644350,795,069340,182,0001,075,00020,480
8Oct 9, 2026 08:2069,664350,407,990340,344,0001,010,00020,480
9Oct 9, 2026 08:2069,756358,576,194340,804,0001,004,00020,480