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:09highload-churnerhighload-churnerScore: 25,252Success
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:1025,216132,528,365122,464,0001,096,0002,113,536
2Oct 12, 2026 05:1025,230132,625,122122,515,0001,113,0002,113,536
3Oct 12, 2026 05:1025,235132,718,727122,539,0001,115,0002,113,536
4Oct 12, 2026 05:1025,242132,691,767122,582,0001,106,0002,113,536
5Oct 12, 2026 05:1025,252132,795,414122,558,0001,178,0002,113,536
6Oct 12, 2026 05:1025,268132,884,447122,692,0001,122,0002,113,536
7Oct 12, 2026 05:1025,378133,345,324123,256,0001,098,0002,113,536
8Oct 12, 2026 05:1049,390251,047,095240,892,0001,123,0002,113,536
9Oct 12, 2026 05:1052,728267,411,094257,196,0001,176,0002,113,536