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 listMay 14, 2023 12:22Yurkov AlekseyYurkov AlekseyScore: 106,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2023 12:22100,249105,353,77437,091,97902,265,088
2May 14, 2023 12:22100,497102,000,95237,183,81402,269,184
3May 14, 2023 12:22101,587110,037,84137,587,20902,260,992
4May 14, 2023 12:22105,27661,222,55236,955,0001,997,0002,289,664
5May 14, 2023 12:22105,84960,613,47237,156,0002,008,0002,277,376
6May 14, 2023 12:22106,13565,031,65137,257,0002,013,0002,277,376
7May 14, 2023 12:22106,74162,067,64838,482,0001,012,0002,289,664
8May 14, 2023 12:22106,83064,930,90638,514,0001,013,0002,289,664
9May 14, 2023 12:22107,27667,809,15339,692,00002,289,664
10May 14, 2023 12:22107,78470,147,20637,886,0001,994,0002,273,280
11May 14, 2023 12:22107,81470,101,59038,894,000997,0002,289,664
12May 14, 2023 12:22107,94971,620,20837,944,0001,997,0002,289,664