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 listSep 15, 2021 17:27piculpiculScore: 87,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 17:2786,04657,468,37229,848,0001,989,0002,519,040
2Sep 15, 2021 17:2786,07862,036,93130,854,000995,0002,289,664
3Sep 15, 2021 17:2786,09260,159,23230,859,000995,0002,527,232
4Sep 15, 2021 17:2786,56860,434,29130,029,0002,001,0002,289,664
5Sep 15, 2021 17:2786,80355,659,24930,110,0002,007,0002,273,280
6Sep 15, 2021 17:2786,80554,388,94530,111,0002,007,0002,363,392
7Sep 15, 2021 17:2787,46854,691,05130,341,0002,022,0002,289,664
8Sep 15, 2021 17:2788,30861,873,11631,653,0001,021,0002,289,664
9Sep 15, 2021 17:2789,49263,835,44231,106,0002,006,0002,289,664
10Sep 15, 2021 17:27112,550104,282,67341,643,46102,265,088
11Sep 15, 2021 17:27113,536112,353,66142,008,23102,256,896
12Sep 15, 2021 17:27115,931104,286,72142,894,30902,252,800