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:43Yurkov AlekseyYurkov AlekseyScore: 98,816Success
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:4397,63560,993,58735,122,0001,003,0002,289,664
2Mar 26, 2023 10:4397,96259,671,57134,233,0002,013,0002,269,184
3Mar 26, 2023 10:4398,47658,833,68835,424,0001,012,0002,531,328
4Mar 26, 2023 10:4398,56564,054,05634,443,0002,026,0002,273,280
5Mar 26, 2023 10:4398,67658,601,79236,510,00002,269,184
6Mar 26, 2023 10:4398,77060,338,14636,545,00002,289,664
7Mar 26, 2023 10:4398,81662,774,50635,547,0001,015,0002,289,664
8Mar 26, 2023 10:4398,91963,382,58135,584,0001,016,0002,273,280
9Mar 26, 2023 10:4399,14662,690,42135,665,0001,019,0002,277,376
10Mar 26, 2023 10:4399,164104,171,62336,690,62902,277,376
11Mar 26, 2023 10:4399,404100,283,94636,779,54002,269,184
12Mar 26, 2023 10:43100,044104,756,49537,016,24402,252,800