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 21:40Yurkov AlekseyYurkov AlekseyScore: 105,519Success
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 21:40103,70860,691,46238,372,00002,289,664
2Jul 8, 2021 21:40104,09558,788,16238,515,00002,527,232
3Jul 8, 2021 21:40104,17861,046,17038,546,00002,289,664
4Jul 8, 2021 21:40104,35967,751,85438,613,00002,289,664
5Jul 8, 2021 21:40105,27865,181,46636,956,0001,997,0002,289,664
6Jul 8, 2021 21:40105,45766,427,32538,019,0001,000,0002,265,088
7Jul 8, 2021 21:40105,51962,331,17637,040,0002,002,0002,289,664
8Jul 8, 2021 21:40105,70060,895,48238,107,0001,002,0002,277,376
9Jul 8, 2021 21:40105,94961,783,40638,196,0001,005,0002,289,664
10Jul 8, 2021 21:40132,088109,244,41748,872,73802,265,088
11Jul 8, 2021 21:40132,612113,851,13349,066,29102,260,992
12Jul 8, 2021 21:40133,277115,699,41949,312,46302,260,992