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 22, 2023 21:59mmalczakmmalczakScore: 74,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2023 21:5973,87655,902,85726,322,0001,012,0002,273,280
2Sep 22, 2023 21:5974,12450,115,10826,411,0001,015,0002,289,664
3Sep 22, 2023 21:5974,30353,792,36826,474,0001,018,0002,363,392
4Sep 22, 2023 21:5974,35449,829,07226,493,0001,018,0002,277,376
5Sep 22, 2023 21:5974,38952,712,69626,505,0001,019,0002,289,664
6Sep 22, 2023 21:5974,46256,437,79426,531,0001,020,0002,289,664
7Sep 22, 2023 21:5974,48949,755,03527,561,00002,273,280
8Sep 22, 2023 21:5974,89253,770,93426,684,0001,026,0002,277,376
9Sep 22, 2023 21:5975,01959,487,86126,766,000991,0002,277,376
10Sep 22, 2023 21:5976,352102,975,32928,250,38702,252,800
11Sep 22, 2023 21:5976,81291,451,23428,420,58902,260,992
12Sep 22, 2023 21:5976,89490,229,78128,450,65902,260,992