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 17, 2025 21:37Aniruddha DebAniruddha DebScore: 70,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2025 21:3770,01953,591,05125,907,00002,428,928
2Mar 17, 2025 21:3770,19548,821,21424,974,000998,0002,269,184
3Mar 17, 2025 21:3770,57354,281,02524,104,0002,008,0002,424,832