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 13, 2021 18:50Yuriy LyfenkoYuriy LyfenkoScore: 65,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 18:5064,930545,972,24422,022,0002,002,0002,281,472
2Jul 13, 2021 18:5064,943548,628,50022,027,0002,002,0002,285,568
3Jul 13, 2021 18:5064,981551,649,91422,040,0002,003,0002,285,568
4Jul 13, 2021 18:5065,127547,287,80722,089,0002,008,0002,281,472
5Jul 13, 2021 18:5065,170542,874,96023,109,0001,004,0002,281,472
6Jul 13, 2021 18:5065,181547,455,05622,108,0002,009,0002,285,568
7Jul 13, 2021 18:5065,289546,984,20723,151,0001,006,0002,285,568
8Jul 13, 2021 18:5065,343546,990,96222,163,0002,014,0002,531,328
9Jul 13, 2021 18:5065,400546,805,37822,182,0002,016,0002,285,568
10Jul 13, 2021 18:5069,644580,579,97125,768,41102,240,512
11Jul 13, 2021 18:5069,978586,267,89725,891,97502,244,608
12Jul 13, 2021 18:5071,347592,388,14026,398,52702,240,512