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 19:38Elijah KinElijah KinScore: 229,157Success
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 19:38228,684110,822,44138,277,00046,336,0002,285,568
2Mar 15, 2026 19:38229,157115,054,79738,903,00045,885,0002,469,888
3Mar 15, 2026 19:38229,827108,952,52640,017,00045,019,0002,465,792