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 24, 2023 21:10mmalczakmmalczakScore: 72,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2023 21:1072,56850,723,98325,856,000994,0002,265,088
2Sep 24, 2023 21:1072,66548,884,85824,895,0001,991,0002,375,680
3Sep 24, 2023 21:1072,70548,900,56524,909,0001,992,0002,289,664
4Sep 24, 2023 21:1072,76253,296,41024,928,0001,994,0002,265,088
5Sep 24, 2023 21:1072,84950,144,24424,958,0001,996,0002,289,664
6Sep 24, 2023 21:1072,86850,217,06324,964,0001,997,0002,355,200
7Sep 24, 2023 21:1072,88149,841,36925,968,000998,0002,289,664
8Sep 24, 2023 21:1072,91450,338,82224,980,0001,998,0002,277,376
9Sep 24, 2023 21:1073,08649,856,90525,039,0002,003,0002,289,664
10Sep 24, 2023 21:1075,746100,673,83928,025,98402,269,184
11Sep 24, 2023 21:1075,813101,640,15528,050,72702,269,184
12Sep 24, 2023 21:1076,01594,387,98428,125,53802,273,280