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 10:41highload-churnerhighload-churnerScore: 55,530Success
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:4355,403280,383,260270,409,0001,070,00020,480
2Oct 9, 2026 10:4355,459280,763,824270,650,0001,103,00020,480
3Oct 9, 2026 10:4355,480280,785,363270,844,0001,009,00020,480
4Oct 9, 2026 10:4355,486280,901,124270,816,0001,070,00020,480
5Oct 9, 2026 10:4355,530280,991,444271,006,0001,094,00020,480
6Oct 9, 2026 10:4355,553281,216,693271,144,0001,066,00020,480
7Oct 9, 2026 10:4355,578288,652,335271,210,0001,127,00020,480
8Oct 9, 2026 10:4355,602281,319,099271,399,0001,055,00020,480
9Oct 9, 2026 10:4356,198284,320,660274,297,0001,076,00020,480