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 14:21highload-churnerhighload-churnerScore: 23,799Success
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 14:2223,790125,462,244115,479,0001,095,0002,113,536
2Oct 12, 2026 14:2223,792125,595,754115,467,0001,115,0002,113,536
3Oct 12, 2026 14:2223,796125,602,038115,578,0001,024,0002,113,536
4Oct 12, 2026 14:2223,797125,576,777115,480,0001,126,0002,113,536
5Oct 12, 2026 14:2223,799125,980,600115,493,0001,126,0002,113,536
6Oct 12, 2026 14:2223,800125,628,367115,570,0001,052,0002,113,536
7Oct 12, 2026 14:2223,800125,725,455115,516,0001,108,0002,113,536
8Oct 12, 2026 14:2223,808125,709,265115,504,0001,157,0002,113,536
9Oct 12, 2026 14:2223,828125,690,998115,617,0001,141,0002,113,536