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 listSep 18, 2023 07:16mmalczakmmalczakScore: 84,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 18, 2023 07:1683,31958,425,98829,834,000994,0002,265,088
2Sep 18, 2023 07:1683,41960,456,02228,874,0001,991,0002,269,184
3Sep 18, 2023 07:1683,47654,664,28528,894,0001,992,0002,523,136
4Sep 18, 2023 07:1683,53252,987,23428,913,0001,994,0002,269,184
5Sep 18, 2023 07:1683,73059,083,57428,982,0001,998,0002,289,664
6Sep 18, 2023 07:1684,04353,298,46430,093,0001,003,0002,273,280
7Sep 18, 2023 07:1684,27852,581,57329,172,0002,011,0002,281,472
8Sep 18, 2023 07:1684,39754,341,60629,213,0002,014,0002,273,280
9Sep 18, 2023 07:1684,48152,587,99430,250,0001,008,0002,289,664
10Sep 18, 2023 07:1685,726100,869,19331,718,44902,265,088
11Sep 18, 2023 07:1685,78396,800,06731,739,59702,277,376
12Sep 18, 2023 07:1686,58395,913,88832,035,87902,269,184