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 20:40Yurkov AlekseyYurkov AlekseyScore: 99,043Success
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 20:4097,52459,760,29834,080,0002,004,0002,273,280
2Mar 25, 2023 20:4097,68959,040,21434,137,0002,008,0002,289,664
3Mar 25, 2023 20:4097,76258,913,76734,163,0002,009,0002,265,088
4Mar 25, 2023 20:4098,10861,054,50034,284,0002,016,0002,273,280
5Mar 25, 2023 20:4098,41460,526,13335,402,0001,011,0002,289,664
6Mar 25, 2023 20:4098,97363,979,87835,603,0001,017,0002,359,296
7Mar 25, 2023 20:4099,04362,015,54236,646,00002,281,472
8Mar 25, 2023 20:4099,15467,636,65635,668,0001,019,0002,289,664
9Mar 25, 2023 20:4099,500112,309,01836,814,93102,265,088
10Mar 25, 2023 20:4099,53297,841,12236,826,69902,256,896
11Mar 25, 2023 20:4099,60064,469,65334,860,0001,992,0002,289,664
12Mar 25, 2023 20:40100,520108,862,04137,192,23502,265,088