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 26, 2025 18:26Aniruddha DebAniruddha DebScore: 69,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2025 18:2669,41452,010,82225,683,00002,404,352
2Mar 26, 2025 18:2669,93053,858,88624,879,000995,0002,269,184
3Mar 26, 2025 18:2670,01654,078,44424,910,000996,0002,531,328