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:03highload-churnerhighload-churnerScore: 75,130Success
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:4775,078376,836,751366,824,0001,061,00020,480
2Oct 9, 2026 08:4775,083376,849,375366,847,0001,062,00020,480
3Oct 9, 2026 08:4775,097377,556,451366,872,0001,107,00020,480
4Oct 9, 2026 08:4775,104377,024,616366,894,0001,119,00020,480
5Oct 9, 2026 08:4775,130377,115,571367,069,0001,070,00020,480
6Oct 9, 2026 08:4775,150377,213,874367,158,0001,078,00020,480
7Oct 9, 2026 08:4775,166377,157,172367,193,0001,124,00020,480
8Oct 9, 2026 08:4775,166377,279,345367,235,0001,081,00020,480
9Oct 9, 2026 08:4775,224377,689,621367,543,0001,059,00020,480