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 13, 2026 07:16highload-churnerhighload-churnerScore: 23,230Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 07:1723,217122,782,566112,695,0001,072,00020,480
2Oct 13, 2026 07:1723,219122,758,233112,718,0001,057,00020,480
3Oct 13, 2026 07:1723,220122,700,774112,723,0001,057,00020,480
4Oct 13, 2026 07:1723,229122,847,496112,762,0001,062,00020,480
5Oct 13, 2026 07:1723,230122,856,444112,759,0001,072,00020,480
6Oct 13, 2026 07:1723,231122,780,151112,750,0001,082,00020,480
7Oct 13, 2026 07:1723,234122,962,127112,741,0001,107,00020,480
8Oct 13, 2026 07:1723,238123,453,076112,808,0001,062,00020,480
9Oct 13, 2026 07:1723,241122,942,791112,754,0001,127,00020,480