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 1, 2022 00:22Yurkov AlekseyYurkov AlekseyScore: 100,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2022 00:2299,58162,374,99434,854,0001,991,0002,289,664
2Sep 1, 2022 00:2299,89257,608,50534,963,0001,997,0002,289,664
3Sep 1, 2022 00:22100,17860,166,51336,065,0001,001,0002,281,472
4Sep 1, 2022 00:22100,20059,172,37035,070,0002,004,0002,387,968
5Sep 1, 2022 00:22100,31660,144,98736,114,0001,003,0002,277,376
6Sep 1, 2022 00:22100,45759,909,27735,160,0002,009,0002,289,664
7Sep 1, 2022 00:22100,50359,044,48035,176,0002,010,0002,269,184
8Sep 1, 2022 00:22100,66857,823,10935,234,0002,013,0002,289,664
9Sep 1, 2022 00:22101,627107,138,60337,602,00002,269,184
10Sep 1, 2022 00:22101,73063,877,31036,623,0001,017,0002,273,280
11Sep 1, 2022 00:22102,093104,020,98937,774,48302,273,280
12Sep 1, 2022 00:22103,565100,749,18538,319,09702,269,184