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:29highload-churnerhighload-churnerScore: 49,240Success
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:1549,150249,753,716237,522,0003,314,00020,480
2Oct 10, 2026 02:1549,205250,114,440237,226,0003,879,00020,480
3Oct 10, 2026 02:1549,210250,030,088237,348,0003,781,00020,480
4Oct 10, 2026 02:1549,226250,271,687237,411,0003,799,00020,480
5Oct 10, 2026 02:1549,240250,207,424237,426,0003,853,00020,480
6Oct 10, 2026 02:1549,278250,481,395237,544,0003,923,00020,480
7Oct 10, 2026 02:1549,303250,711,016237,588,0003,998,00020,480
8Oct 10, 2026 02:1549,516251,661,013238,835,0003,796,00020,480
9Oct 10, 2026 02:1551,334260,556,449247,811,0003,726,00020,480