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:50Yurkov AlekseyYurkov AlekseyScore: 165,057Success
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:5099,59093,639,36336,848,38802,256,896
2Jul 15, 2021 22:5099,808100,544,96736,928,90502,260,992
3Jul 15, 2021 22:50100,898109,348,33637,332,34902,269,184
4Jul 15, 2021 22:50164,39794,769,34758,833,0001,994,0002,281,472
5Jul 15, 2021 22:50164,63085,985,02658,916,0001,997,0002,273,280
6Jul 15, 2021 22:50164,78484,760,51058,971,0001,999,0002,273,280
7Jul 15, 2021 22:50165,05783,842,17159,069,0002,002,0002,527,232
8Jul 15, 2021 22:50165,10584,091,12259,087,0002,002,0002,289,664
9Jul 15, 2021 22:50165,28484,325,96860,153,0001,002,0002,289,664
10Jul 15, 2021 22:50165,42288,306,43359,200,0002,006,0002,289,664
11Jul 15, 2021 22:50165,48684,615,66760,227,0001,003,0002,289,664
12Jul 15, 2021 22:50166,10884,035,05660,453,0001,007,0002,289,664