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 listJun 21, 2026 22:48A_ShamanA_ShamanScore: 74,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 22:5173,63236,448,10826,200,0001,044,0002,113,536
2Jun 21, 2026 22:5173,95936,630,28726,319,0001,046,0002,113,536
3Jun 21, 2026 22:5173,98336,609,65826,328,0001,046,0002,113,536
4Jun 21, 2026 22:5174,01036,595,86326,339,0001,045,0002,113,536
5Jun 21, 2026 22:5174,02136,588,16826,343,0001,045,0002,113,536
6Jun 21, 2026 22:5174,08636,638,98226,366,0001,046,0002,113,536
7Jun 21, 2026 22:5174,69137,286,92726,580,0001,056,0002,113,536
8Jun 21, 2026 22:5174,87237,319,02126,647,0001,056,0002,113,536
9Jun 21, 2026 22:5174,90236,938,82526,660,0001,054,0002,113,536