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 25, 2023 18:14Yurkov AlekseyYurkov AlekseyScore: 99,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2023 18:1497,79562,361,47035,179,0001,005,0002,289,664
2Mar 25, 2023 18:1498,31160,684,92934,355,0002,020,0002,289,664
3Mar 25, 2023 18:1498,50561,698,33636,447,00002,289,664
4Mar 25, 2023 18:1498,54359,723,08135,449,0001,012,0002,277,376
5Mar 25, 2023 18:1498,75157,269,32935,524,0001,014,0002,281,472
6Mar 25, 2023 18:1498,79757,566,40835,540,0001,015,0002,289,664
7Mar 25, 2023 18:1499,48962,621,23435,817,000994,0002,289,664
8Mar 25, 2023 18:1499,94958,276,60634,982,0001,999,0002,289,664
9Mar 25, 2023 18:14100,38160,260,43635,134,0002,007,0002,281,472
10Mar 25, 2023 18:14131,517105,972,54248,661,15502,273,280
11Mar 25, 2023 18:14132,628113,551,72749,072,50202,265,088
12Mar 25, 2023 18:14132,649110,161,51249,080,25802,265,088