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 23:22Aniruddha DebAniruddha DebScore: 71,457Success
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 23:2271,23552,716,60226,357,00002,428,928
2Mar 17, 2025 23:2271,45753,220,41826,439,00002,428,928
3Mar 17, 2025 23:2271,82253,253,05226,574,00002,531,328