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 15, 2025 12:20Aniruddha DebAniruddha DebScore: 69,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2025 12:2068,88144,518,90325,486,00002,420,736
2Mar 15, 2025 12:2068,99545,640,37224,507,0001,021,0002,531,328
3Mar 15, 2025 12:2069,06554,541,13724,532,0001,022,0002,531,328
4Mar 15, 2025 12:2069,07647,756,68125,558,00002,531,328
5Mar 15, 2025 12:2069,10856,816,86824,548,0001,022,0002,420,736
6Mar 15, 2025 12:2069,19551,332,13724,578,0001,024,0002,531,328
7Mar 15, 2025 12:2069,40559,257,56824,653,0001,027,0002,531,328
8Mar 15, 2025 12:2069,80856,638,34624,836,000993,0002,531,328
9Mar 15, 2025 12:2069,92452,024,55525,872,00002,428,928