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 8, 2021 20:01Yurkov AlekseyYurkov AlekseyScore: 105,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 20:01104,05460,694,64338,500,00002,289,664
2Jul 8, 2021 20:01104,35964,587,41638,613,00002,273,280
3Jul 8, 2021 20:01104,96265,818,77136,845,0001,991,0002,289,664
4Jul 8, 2021 20:01104,96567,060,23937,842,000995,0002,277,376
5Jul 8, 2021 20:01104,98468,796,46036,852,0001,992,0002,281,472
6Jul 8, 2021 20:01105,18162,741,27037,920,000997,0002,289,664
7Jul 8, 2021 20:01105,32459,521,95636,972,0001,998,0002,269,184
8Jul 8, 2021 20:01105,73266,741,59738,118,0001,003,0002,289,664
9Jul 8, 2021 20:01121,32267,885,35642,894,0001,995,0002,265,088
10Jul 8, 2021 20:01131,978129,431,05648,831,70902,260,992
11Jul 8, 2021 20:01132,117103,969,32548,883,34002,269,184
12Jul 8, 2021 20:01132,191101,384,27648,910,75702,265,088