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 20, 2026 09:19e1011e1011Score: 102,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 09:2197,86447,102,90635,022,0001,188,0002,113,536
2Oct 20, 2026 09:2199,51647,741,61035,713,0001,108,0002,113,536
3Oct 20, 2026 09:2199,53748,238,75435,630,0001,199,0002,113,536
4Oct 20, 2026 09:21100,47848,120,57935,978,0001,199,0002,113,536
5Oct 20, 2026 09:21102,94548,988,24036,946,0001,144,0002,113,536
6Oct 20, 2026 09:21103,14349,171,51637,058,0001,105,0002,113,536
7Oct 20, 2026 09:21103,90049,851,32937,246,0001,197,0002,113,536
8Oct 20, 2026 09:21104,04349,912,75637,307,0001,189,0002,113,536
9Oct 20, 2026 09:21104,79150,134,50337,586,0001,187,0002,113,536