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 listMar 26, 2023 10:46Yurkov AlekseyYurkov AlekseyScore: 132,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2023 10:46131,33577,145,16947,582,0001,012,0002,289,664
2Mar 26, 2023 10:46132,00377,781,63446,848,0001,993,0002,277,376
3Mar 26, 2023 10:46132,071111,741,73248,866,21002,256,896
4Mar 26, 2023 10:46132,14370,402,64146,898,0001,995,0002,273,280
5Mar 26, 2023 10:46132,19770,779,37046,917,0001,996,0002,371,584
6Mar 26, 2023 10:46132,20373,229,00747,917,000998,0002,289,664
7Mar 26, 2023 10:46132,21483,476,40247,921,000998,0002,277,376
8Mar 26, 2023 10:46132,23871,687,85047,930,000998,0002,289,664
9Mar 26, 2023 10:46132,45470,214,44147,008,0002,000,0002,269,184
10Mar 26, 2023 10:46132,492114,006,54049,022,17602,277,376
11Mar 26, 2023 10:46132,54374,335,33147,040,0002,001,0002,289,664
12Mar 26, 2023 10:46132,552119,584,25749,044,12902,252,800