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 listMay 21, 2026 19:06M-RochatM-RochatScore: 58,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 19:0758,62430,430,11421,691,00002,113,536
2May 21, 2026 19:0758,63729,975,52521,696,00002,113,536
3May 21, 2026 19:0758,74332,601,30021,735,00002,113,536
4May 21, 2026 19:0758,74331,487,17521,735,00002,113,536
5May 21, 2026 19:0758,76229,731,29821,742,00002,113,536
6May 21, 2026 19:0758,78329,589,25920,729,0001,021,0002,113,536
7May 21, 2026 19:0758,94331,434,57521,809,00002,113,536
8May 21, 2026 19:0758,99731,031,52721,829,00002,113,536
9May 21, 2026 19:0759,38630,301,38720,924,0001,049,0002,113,536