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 listApr 3, 2023 21:21Yurkov AlekseyYurkov AlekseyScore: 110,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 21:2199,077111,058,14936,658,35302,273,280
2Apr 3, 2023 21:2199,16288,849,32036,689,95002,260,992
3Apr 3, 2023 21:2199,696117,070,36036,887,48602,277,376
4Apr 3, 2023 21:21109,25467,980,52739,414,0001,010,0002,289,664
5Apr 3, 2023 21:21109,92267,999,37739,655,0001,016,0002,527,232
6Apr 3, 2023 21:21109,92772,153,26940,673,00002,289,664
7Apr 3, 2023 21:21110,33070,374,89038,831,0001,991,0002,289,664
8Apr 3, 2023 21:21110,33066,987,93138,831,0001,991,0002,285,568
9Apr 3, 2023 21:21110,37368,031,91339,842,000996,0002,289,664
10Apr 3, 2023 21:21110,41969,496,22538,863,0001,992,0002,289,664
11Apr 3, 2023 21:21110,43064,109,34538,866,0001,993,0002,289,664
12Apr 3, 2023 21:21110,45971,375,13638,877,0001,993,0002,265,088