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 listMar 15, 2026 22:02Elijah KinElijah KinScore: 157,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 22:02157,47683,952,67911,050,00047,216,0002,260,992
2Mar 15, 2026 22:02157,73278,222,41118,112,00040,249,0002,260,992
3Mar 15, 2026 22:02157,97684,858,74512,093,00046,358,0002,318,336