TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listOct 12, 2026 13:42highload-churnerhighload-churnerScore: 111,889Success
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 13:43108,61849,077,86138,794,0001,395,00024,576
2Oct 12, 2026 13:43111,73250,196,98139,952,0001,389,00024,576
3Oct 12, 2026 13:43111,79450,280,80439,958,0001,406,00024,576
4Oct 12, 2026 13:43111,88350,300,13740,004,0001,393,00024,576
5Oct 12, 2026 13:43111,88950,294,99640,019,0001,380,00024,576
6Oct 12, 2026 13:43111,95450,288,58840,026,0001,397,00024,576
7Oct 12, 2026 13:43112,00050,415,34840,045,0001,395,00024,576
8Oct 12, 2026 13:43112,14351,715,31540,085,0001,408,00024,576
9Oct 12, 2026 13:43113,11350,581,05640,450,0001,402,00024,576