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 listDec 4, 2024 03:50Hayden DonnellyHayden DonnellyScore: 114,084Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2024 03:50113,06571,365,79039,842,0001,992,0002,527,232
2Dec 4, 2024 03:50113,08472,532,71839,849,0001,992,0002,285,568
3Dec 4, 2024 03:50113,29573,988,75639,923,0001,996,0002,285,568
4Dec 4, 2024 03:50114,01464,662,28940,177,0002,008,0002,285,568
5Dec 4, 2024 03:50114,08466,261,02140,201,0002,010,0002,285,568
6Dec 4, 2024 03:50114,11966,022,73040,214,0002,010,0002,273,280
7Dec 4, 2024 03:50114,34367,489,53440,293,0002,014,0002,265,088
8Dec 4, 2024 03:50114,46567,310,51941,344,0001,008,0002,277,376
9Dec 4, 2024 03:50115,28477,780,33340,624,0002,031,0002,285,568