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 3, 2023 21:47Yurkov AlekseyYurkov AlekseyScore: 99,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 21:4798,32759,124,12234,360,0002,021,0002,289,664
2Apr 3, 2023 21:4798,57662,303,20336,473,00002,289,664
3Apr 3, 2023 21:4798,61661,470,82036,488,00002,289,664
4Apr 3, 2023 21:4798,75758,740,79135,525,0001,015,0002,289,664
5Apr 3, 2023 21:4798,94663,081,54435,594,0001,016,0002,277,376
6Apr 3, 2023 21:4799,75464,370,24634,914,0001,995,0002,289,664
7Apr 3, 2023 21:4799,90861,270,11534,968,0001,998,0002,289,664
8Apr 3, 2023 21:4799,98665,810,30934,996,0001,999,0002,273,280
9Apr 3, 2023 21:47100,41963,211,54736,151,0001,004,0002,289,664
10Apr 3, 2023 21:47106,403113,190,88739,369,20202,273,280
11Apr 3, 2023 21:47106,671115,597,14539,468,21402,269,184
12Apr 3, 2023 21:47106,743112,931,81839,494,87802,273,280