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 listAug 4, 2022 19:55Franek KortaFranek KortaScore: 109,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2022 19:55106,375100,618,05439,358,75302,260,992
2Aug 4, 2022 19:55107,004103,390,13439,591,46802,269,184
3Aug 4, 2022 19:55107,216109,394,98339,670,09602,260,992
4Aug 4, 2022 19:55108,57665,687,57537,160,0003,013,0002,281,472
5Aug 4, 2022 19:55109,01162,566,22738,318,0002,016,0002,281,472
6Aug 4, 2022 19:55109,45459,690,83838,474,0002,024,0002,281,472
7Aug 4, 2022 19:55109,67663,511,81039,566,0001,014,0002,281,472
8Aug 4, 2022 19:55110,35470,275,09339,836,000995,0002,281,472
9Aug 4, 2022 19:55111,66867,389,84440,310,0001,007,0002,535,424
10Aug 4, 2022 19:55111,67365,560,80037,288,0004,031,0002,269,184
11Aug 4, 2022 19:55112,07362,524,55039,445,0002,022,0002,285,568
12Aug 4, 2022 19:55112,48165,391,55940,603,0001,015,0002,269,184