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 listApr 9, 2023 17:12Franek KortaFranek KortaScore: 77,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 17:1274,44151,465,24325,503,0002,040,0002,265,088
2Apr 9, 2023 17:1274,45448,962,22326,528,0001,020,0002,424,832
3Apr 9, 2023 17:1276,28454,477,41026,209,0002,016,0002,424,832
4Apr 9, 2023 17:1276,83250,340,00328,428,00002,424,832
5Apr 9, 2023 17:1277,00360,508,89728,491,00002,265,088
6Apr 9, 2023 17:1277,31655,837,00826,564,0002,043,0002,531,328
7Apr 9, 2023 17:1277,46553,888,87027,639,0001,023,0002,416,640
8Apr 9, 2023 17:1277,63259,557,07527,699,0001,025,0002,433,024
9Apr 9, 2023 17:1277,97852,849,51227,858,000994,0002,269,184
10Apr 9, 2023 17:1281,80487,873,65930,267,49102,179,072
11Apr 9, 2023 17:1282,88194,774,72030,665,85502,285,568
12Apr 9, 2023 17:1284,24791,720,12831,171,41002,293,760