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 10, 2026 09:26Tomislav TunkovicTomislav TunkovicScore: 56,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 09:2756,78929,626,97821,012,000024,576stderr
2Sep 10, 2026 09:2756,84029,400,42121,031,000024,576stderr
3Sep 10, 2026 09:2756,85929,801,25921,038,000024,576stderr
4Sep 10, 2026 09:2756,93229,675,95121,065,000024,576stderr
5Sep 10, 2026 09:2756,95130,382,64321,072,000024,576stderr
6Sep 10, 2026 09:2757,11629,721,41021,133,000024,576stderr
7Sep 10, 2026 09:2757,14029,437,81721,142,000024,576stderr
8Sep 10, 2026 09:2757,23229,819,29121,176,000024,576stderr
9Sep 10, 2026 09:2757,34829,902,82920,218,0001,001,00024,576stderr