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 12, 2026 12:52highload-churnerhighload-churnerScore: 23,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 12:5323,547124,357,072114,288,0001,097,0002,113,536
2Oct 12, 2026 12:5323,550124,358,325114,289,0001,108,0002,113,536
3Oct 12, 2026 12:5323,550124,395,411114,272,0001,126,0002,113,536
4Oct 12, 2026 12:5323,550124,424,965114,285,0001,110,0002,113,536
5Oct 12, 2026 12:5323,551124,876,736114,293,0001,109,0002,113,536
6Oct 12, 2026 12:5323,552124,665,394114,300,0001,109,0002,113,536
7Oct 12, 2026 12:5323,552124,352,363114,303,0001,104,0002,113,536
8Oct 12, 2026 12:5323,556125,068,746114,369,0001,059,0002,113,536
9Oct 12, 2026 12:5323,556124,420,522114,305,0001,120,0002,113,536