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:52Aniruddha DebAniruddha DebScore: 70,005Success
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:5269,87352,685,58023,865,0001,988,0002,523,136
2Mar 26, 2025 21:5270,00550,706,02324,906,000996,0002,523,136
3Mar 26, 2025 21:5270,23550,596,67724,988,000999,0002,400,256