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 27, 2024 17:40Matthew SillsMatthew SillsScore: 109,935Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2024 17:40108,67065,304,71838,198,0002,010,0002,289,664
2Jul 27, 2024 17:40108,81465,807,66938,248,0002,013,0002,269,184
3Jul 27, 2024 17:40109,15165,874,70938,367,0002,019,0002,523,136
4Jul 27, 2024 17:40109,20062,053,95339,394,0001,010,0002,289,664
5Jul 27, 2024 17:40109,31662,836,00339,436,0001,011,0002,289,664
6Jul 27, 2024 17:40109,70074,137,94840,589,00002,289,664
7Jul 27, 2024 17:40109,93568,628,56339,660,0001,016,0002,289,664
8Jul 27, 2024 17:40110,00369,854,27139,684,0001,017,0002,289,664
9Jul 27, 2024 17:40110,35966,538,69638,842,0001,991,0002,289,664
10Jul 27, 2024 17:40112,078109,382,69141,468,85002,269,184
11Jul 27, 2024 17:40112,461107,651,39841,610,43902,273,280
12Jul 27, 2024 17:40113,154101,830,36341,866,82202,400,256