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 15, 2021 22:45Yurkov AlekseyYurkov AlekseyScore: 98,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2021 22:4597,52758,477,41635,083,0001,002,0002,273,280
2Jul 15, 2021 22:4597,91159,545,49534,215,0002,012,0002,289,664
3Jul 15, 2021 22:4598,00559,717,90534,248,0002,014,0002,289,664
4Jul 15, 2021 22:4598,24958,819,31534,333,0002,019,0002,277,376
5Jul 15, 2021 22:4598,38160,124,39836,401,00002,289,664
6Jul 15, 2021 22:4598,93270,280,77835,589,0001,016,0002,289,664
7Jul 15, 2021 22:4598,979113,876,70336,622,11502,273,280
8Jul 15, 2021 22:4599,62461,742,98636,861,00002,371,584
9Jul 15, 2021 22:4599,63267,662,11435,868,000996,0002,289,664
10Jul 15, 2021 22:4599,70559,292,94734,897,0001,994,0002,289,664
11Jul 15, 2021 22:4599,76387,457,29836,912,47902,273,280
12Jul 15, 2021 22:4599,930101,401,49236,974,17002,252,800