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 24, 2024 19:05CemaCemaScore: 85,203Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2024 19:0584,18953,542,73129,141,0002,009,0002,289,664
2May 24, 2024 19:0584,41952,310,09429,220,0002,015,0002,289,664
3May 24, 2024 19:0584,60556,780,18030,295,0001,009,0002,527,232
4May 24, 2024 19:0584,75959,114,40029,338,0002,023,0002,281,472
5May 24, 2024 19:0584,82454,498,70729,361,0002,024,0002,273,280
6May 24, 2024 19:0585,15456,692,44031,507,00002,289,664
7May 24, 2024 19:0585,20353,784,33430,509,0001,016,0002,265,088
8May 24, 2024 19:0585,64359,773,54830,666,0001,022,0002,289,664
9May 24, 2024 19:0586,01960,617,90730,833,000994,0002,289,664
10May 24, 2024 19:0587,52494,845,56232,383,78102,256,896
11May 24, 2024 19:0587,54694,612,90432,391,99302,260,992
12May 24, 2024 19:0588,47491,866,50332,735,30802,265,088