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 13, 2026 01:47highload-churnerhighload-churnerScore: 55,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 01:4854,94829,195,91120,331,000020,480
2Oct 13, 2026 01:4854,97029,200,98320,339,000020,480
3Oct 13, 2026 01:4854,97829,248,70220,342,000020,480
4Oct 13, 2026 01:4854,98130,758,39520,343,000020,480
5Oct 13, 2026 01:4855,01029,268,06720,354,000020,480
6Oct 13, 2026 01:4855,02429,341,16820,359,000020,480
7Oct 13, 2026 01:4855,07829,267,16020,379,000020,480
8Oct 13, 2026 01:4855,08129,171,09820,380,000020,480
9Oct 13, 2026 01:4855,14329,369,09820,403,000020,480