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 listJan 29, 2024 15:31AnSaAnSaScore: 74,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2024 15:3173,66848,096,67024,229,0003,028,0002,265,088
2Jan 29, 2024 15:3173,68450,129,19924,234,0003,029,0002,273,280
3Jan 29, 2024 15:3174,01149,514,57025,356,0002,028,0002,277,376
4Jan 29, 2024 15:3174,03254,120,36825,363,0002,029,0002,375,680
5Jan 29, 2024 15:3174,08151,028,47827,410,00002,277,376
6Jan 29, 2024 15:3174,11652,311,46624,376,0003,047,0002,371,584
7Jan 29, 2024 15:3174,16248,671,30626,424,0001,016,0002,531,328
8Jan 29, 2024 15:3174,30056,666,87325,455,0002,036,0002,277,376
9Jan 29, 2024 15:3174,40052,935,65026,509,0001,019,0002,277,376
10Jan 29, 2024 15:3178,117100,241,20128,903,40702,269,184
11Jan 29, 2024 15:3178,37790,156,86028,999,37902,260,992
12Jan 29, 2024 15:3178,66795,377,75829,106,68002,265,088