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 11, 2026 22:40highload-churnerhighload-churnerScore: 25,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2026 22:4025,846135,667,912125,629,0001,019,0002,113,536
2Oct 11, 2026 22:4025,862135,746,845125,700,0001,026,0002,113,536
3Oct 11, 2026 22:4025,863135,778,265125,627,0001,106,0002,113,536
4Oct 11, 2026 22:4025,867137,101,645125,645,0001,105,0002,113,536
5Oct 11, 2026 22:4025,881135,883,381125,698,0001,119,0002,113,536
6Oct 11, 2026 22:4025,910136,082,338125,937,0001,024,0002,113,536
7Oct 11, 2026 22:4026,001136,396,708126,296,0001,111,0002,113,536
8Oct 11, 2026 22:4026,034136,566,291126,465,0001,106,0002,113,536
9Oct 11, 2026 22:4026,048136,762,433126,460,0001,177,0002,113,536