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 15:20highload-churnerhighload-churnerScore: 55,472Success
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 15:2155,28329,238,89720,455,00002,113,536
2Oct 12, 2026 15:2155,32929,308,12620,472,00002,113,536
3Oct 12, 2026 15:2155,42129,347,93120,506,00002,113,536
4Oct 12, 2026 15:2155,42429,278,59119,470,0001,037,0002,113,536
5Oct 12, 2026 15:2155,47229,264,71520,525,00002,113,536
6Oct 12, 2026 15:2155,50829,465,69120,538,00002,113,536
7Oct 12, 2026 15:2155,53529,446,03320,548,00002,113,536
8Oct 12, 2026 15:2155,55129,350,74419,522,0001,032,0002,113,536
9Oct 12, 2026 15:2155,84829,473,58319,619,0001,045,0002,113,536