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 21:50Aniruddha DebAniruddha DebScore: 70,868Success
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 21:5070,54653,574,79525,099,0001,003,0002,408,448
2Mar 26, 2025 21:5070,86848,128,74025,213,0001,008,0002,404,352
3Mar 26, 2025 21:5071,76553,053,76026,553,00002,396,160