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 listSep 26, 2026 19:09Kevin HeaveyKevin HeaveyScore: 53,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 19:2853,67828,957,75819,861,000020,480
2Sep 26, 2026 19:2853,70228,701,72419,870,000020,480
3Sep 26, 2026 19:2853,74029,382,92519,884,000020,480
4Sep 26, 2026 19:2853,76228,726,13619,892,000020,480
5Sep 26, 2026 19:2853,77029,278,71419,895,000020,480
6Sep 26, 2026 19:2853,80828,573,63119,909,000020,480
7Sep 26, 2026 19:2853,81328,821,52519,911,000020,480
8Sep 26, 2026 19:2853,81829,370,44419,913,000020,480
9Sep 26, 2026 19:2853,85928,719,14119,928,000020,480