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 20:36Yurkov AlekseyYurkov AlekseyScore: 98,859Success
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 20:3697,66860,446,76934,130,0002,007,0002,289,664
2Mar 25, 2023 20:3697,91159,853,23835,221,0001,006,0002,277,376
3Mar 25, 2023 20:3697,93262,166,87434,222,0002,013,0002,289,664
4Mar 25, 2023 20:3697,95957,939,40735,239,0001,006,0002,289,664
5Mar 25, 2023 20:3698,18961,615,07535,321,0001,009,0002,289,664
6Mar 25, 2023 20:3698,31156,521,13035,365,0001,010,0002,289,664
7Mar 25, 2023 20:3698,85958,408,35935,562,0001,016,0002,289,664
8Mar 25, 2023 20:3698,87863,967,01535,569,0001,016,0002,527,232
9Mar 25, 2023 20:3699,03866,662,25235,627,0001,017,0002,392,064
10Mar 25, 2023 20:3699,561110,694,48536,837,47302,269,184
11Mar 25, 2023 20:3699,684107,721,30036,883,09102,273,280
12Mar 25, 2023 20:36100,255105,198,75437,094,30002,269,184