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 14, 2025 22:35Aniruddha DebAniruddha DebScore: 143,419Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2025 22:35143,10586,734,87150,951,0001,998,0002,269,184
2Mar 14, 2025 22:35143,41984,908,30252,064,0001,001,0002,531,328
3Mar 14, 2025 22:35144,58174,979,98553,495,00002,269,184