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: 63,753Success
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:2363,725321,239,371311,184,0001,070,00020,480
2Oct 9, 2026 08:2363,732321,265,124311,243,0001,048,00020,480
3Oct 9, 2026 08:2363,745321,362,395311,285,0001,070,00020,480
4Oct 9, 2026 08:2363,747321,471,711311,177,0001,188,00020,480
5Oct 9, 2026 08:2363,753321,365,303311,329,0001,061,00020,480
6Oct 9, 2026 08:2363,761321,438,903311,316,0001,117,00020,480
7Oct 9, 2026 08:2363,764321,399,628311,385,0001,061,00020,480
8Oct 9, 2026 08:2366,569335,269,973325,131,0001,059,00020,480
9Oct 9, 2026 08:2367,958341,892,585331,937,0001,058,00020,480