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 08:19highload-churnerhighload-churnerScore: 61,603Success
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 09:1461,453310,124,149300,060,0001,063,00020,480
2Oct 9, 2026 09:1461,558310,589,210300,559,0001,078,00020,480
3Oct 9, 2026 09:1461,577310,746,863300,641,0001,089,00020,480
4Oct 9, 2026 09:1461,586310,516,451300,723,0001,050,00020,480
5Oct 9, 2026 09:1461,603312,147,625300,793,0001,063,00020,480
6Oct 9, 2026 09:1461,654311,004,692301,010,0001,099,00020,480
7Oct 9, 2026 09:1461,677311,162,909301,158,0001,062,00020,480
8Oct 9, 2026 09:1461,681311,291,758301,180,0001,060,00020,480
9Oct 9, 2026 09:1461,726312,655,124301,401,0001,059,00020,480