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 listMar 25, 2023 18:15Yurkov AlekseyYurkov AlekseyScore: 98,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2023 18:1597,55456,831,48735,093,0001,002,0002,289,664
2Mar 25, 2023 18:1597,92458,739,24334,220,0002,012,0002,273,280
3Mar 25, 2023 18:1597,97358,888,45834,237,0002,013,0002,392,064
4Mar 25, 2023 18:1598,20361,563,36535,326,0001,009,0002,277,376
5Mar 25, 2023 18:1598,44364,052,93435,413,0001,011,0002,289,664
6Mar 25, 2023 18:1598,44660,262,51135,414,0001,011,0002,289,664
7Mar 25, 2023 18:1598,57357,641,41335,459,0001,013,0002,265,088
8Mar 25, 2023 18:1598,71161,695,74435,509,0001,014,0002,289,664
9Mar 25, 2023 18:1599,04361,954,63035,629,0001,017,0002,281,472
10Mar 25, 2023 18:15131,953101,108,85648,822,68602,252,800
11Mar 25, 2023 18:15132,376117,821,53548,978,93902,269,184
12Mar 25, 2023 18:15133,524106,811,86449,403,93602,256,896