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 07:33highload-churnerhighload-churnerScore: 82,121Success
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 07:4582,097411,194,893401,223,0001,056,00020,480
2Oct 9, 2026 07:4582,110411,260,998401,263,0001,079,00020,480
3Oct 9, 2026 07:4582,112411,239,603401,288,0001,063,00020,480
4Oct 9, 2026 07:4582,118411,450,076401,253,0001,129,00020,480
5Oct 9, 2026 07:4582,121411,379,635401,325,0001,069,00020,480
6Oct 9, 2026 07:4582,152411,665,624401,417,0001,132,00020,480
7Oct 9, 2026 07:4583,235418,409,418406,784,0001,070,00020,480
8Oct 9, 2026 07:4583,244417,825,827406,765,0001,134,00020,480
9Oct 9, 2026 07:4583,925420,249,804410,126,0001,111,00020,480