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 19:49highload-churnerhighload-churnerScore: 60,341Success
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 19:4960,282304,351,133294,314,0001,068,00020,480
2Oct 9, 2026 19:4960,284304,153,536294,290,0001,105,00020,480
3Oct 9, 2026 19:4960,303305,032,046294,432,0001,055,00020,480
4Oct 9, 2026 19:4960,324304,545,387294,520,0001,071,00020,480
5Oct 9, 2026 19:4960,341304,695,546294,541,0001,130,00020,480
6Oct 9, 2026 19:4960,442305,149,074295,101,0001,065,00020,480
7Oct 9, 2026 19:4961,023307,929,408298,003,0001,012,00020,480
8Oct 9, 2026 19:4961,966312,549,071302,556,0001,078,00020,480
9Oct 9, 2026 19:4961,985312,786,025302,679,0001,052,00020,480