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 listJul 16, 2023 14:58Paul MasurelPaul MasurelScore: 68,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 14:5868,53248,386,97925,357,00002,289,664
2Jul 16, 2023 14:5868,54649,269,67925,362,00002,289,664
3Jul 16, 2023 14:5868,60851,323,60223,355,0002,030,0002,363,392
4Jul 16, 2023 14:5868,67653,179,56824,394,0001,016,0002,347,008
5Jul 16, 2023 14:5868,89750,738,07724,473,0001,019,0002,289,664
6Jul 16, 2023 14:5868,90350,418,40524,475,0001,019,0002,355,200
7Jul 16, 2023 14:5868,95745,274,50324,494,0001,020,0002,355,200
8Jul 16, 2023 14:5868,96551,945,98924,497,0001,020,0002,289,664
9Jul 16, 2023 14:5872,10599,084,29626,678,69502,187,264
10Jul 16, 2023 14:5872,205107,485,21126,715,84102,191,360
11Jul 16, 2023 14:5880,74357,472,51528,880,000995,0002,289,664
12Jul 16, 2023 14:5888,078107,629,38332,588,93802,256,896