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 listMay 14, 2023 12:25Yurkov AlekseyYurkov AlekseyScore: 98,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2023 12:2597,27061,427,20933,991,0001,999,0002,289,664
2May 14, 2023 12:2597,38459,179,23235,032,0001,000,0002,265,088
3May 14, 2023 12:2597,65458,822,53035,129,0001,003,0002,404,352
4May 14, 2023 12:2598,00058,803,66734,246,0002,014,0002,277,376
5May 14, 2023 12:2598,02259,006,01935,261,0001,007,0002,289,664
6May 14, 2023 12:2598,49561,400,75035,431,0001,012,0002,277,376
7May 14, 2023 12:2598,87664,455,25635,568,0001,016,0002,273,280
8May 14, 2023 12:2598,97488,369,89036,620,51502,260,992
9May 14, 2023 12:2599,05461,285,14735,632,0001,018,0002,527,232
10May 14, 2023 12:2599,663108,861,33636,875,25802,269,184
11May 14, 2023 12:2599,982107,797,35536,993,48802,269,184
12May 14, 2023 12:25100,15965,278,61935,056,0002,003,0002,289,664