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 13, 2025 23:40Aniruddha DebAniruddha DebScore: 124,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2025 23:40123,86873,102,57144,835,000996,0002,424,832
2Mar 13, 2025 23:40124,14977,272,09844,937,000998,0002,531,328
3Mar 13, 2025 23:40124,25464,009,64144,975,000999,0002,424,832
4Mar 13, 2025 23:40124,30365,525,76344,993,000999,0002,269,184
5Mar 13, 2025 23:40124,38663,626,21045,023,0001,000,0002,269,184
6Mar 13, 2025 23:40124,48170,622,41846,058,00002,510,848
7Mar 13, 2025 23:40124,56564,066,26145,088,0001,001,0002,428,928
8Mar 13, 2025 23:40124,59772,685,05545,099,0001,002,0002,433,024
9Mar 13, 2025 23:40124,79267,350,30945,170,0001,003,0002,510,848