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 10, 2026 01:53highload-churnerhighload-churnerScore: 41,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 02:1741,179210,791,532198,719,0003,061,00020,480
2Oct 10, 2026 02:1741,181212,202,740199,978,0001,812,00020,480
3Oct 10, 2026 02:1741,227211,025,694198,806,0003,207,00020,480
4Oct 10, 2026 02:1741,248211,563,547199,056,0003,062,00020,480
5Oct 10, 2026 02:1741,259211,182,421199,098,0003,073,00020,480
6Oct 10, 2026 02:1741,283211,433,124198,749,0003,541,00020,480
7Oct 10, 2026 02:1741,359211,711,063198,976,0003,685,00020,480
8Oct 10, 2026 02:1741,414211,934,601199,154,0003,775,00020,480
9Oct 10, 2026 02:1743,758223,442,180211,228,0003,189,00020,480