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 00:40highload-churnerhighload-churnerScore: 54,940Success
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 00:4154,83229,189,10320,288,000020,480
2Oct 12, 2026 00:4154,86229,106,80520,299,000020,480
3Oct 12, 2026 00:4154,92729,208,37420,323,000020,480
4Oct 12, 2026 00:4154,92929,217,16220,324,000020,480
5Oct 12, 2026 00:4154,94029,094,70020,328,000020,480
6Oct 12, 2026 00:4155,03229,626,95520,362,000020,480
7Oct 12, 2026 00:4155,04329,081,16920,366,000020,480
8Oct 12, 2026 00:4155,17229,333,19320,414,000020,480
9Oct 12, 2026 00:4155,23229,358,72320,436,000020,480