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 05:04highload-churnerhighload-churnerScore: 26,048Success
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 05:0425,865135,690,531125,633,0001,108,0002,113,536
2Oct 12, 2026 05:0425,977136,264,265126,184,0001,105,0002,113,536
3Oct 12, 2026 05:0425,997136,908,471126,280,0001,108,0002,113,536
4Oct 12, 2026 05:0426,012136,509,927126,457,0001,006,0002,113,536
5Oct 12, 2026 05:0426,048136,629,651126,507,0001,129,0002,113,536
6Oct 12, 2026 05:0426,087136,894,222126,653,0001,178,0002,113,536
7Oct 12, 2026 05:0426,123136,976,732126,875,0001,132,0002,113,536
8Oct 12, 2026 05:0426,392138,383,737128,109,0001,213,0002,113,536
9Oct 12, 2026 05:0426,399138,369,615128,254,0001,104,0002,113,536