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 17, 2024 16:19spacecat8086spacecat8086Score: 98,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2024 16:1997,80358,973,97234,177,0002,010,0002,285,568
2Dec 17, 2024 16:1998,04959,172,23434,263,0002,015,0002,269,184
3Dec 17, 2024 16:1998,29760,769,91935,360,0001,010,0002,269,184
4Dec 17, 2024 16:1998,55159,702,09235,452,0001,012,0002,285,568
5Dec 17, 2024 16:1998,85759,778,88735,561,0001,016,0002,285,568
6Dec 17, 2024 16:1999,00068,699,89735,613,0001,017,0002,285,568
7Dec 17, 2024 16:1999,61964,191,14635,863,000996,0002,285,568
8Dec 17, 2024 16:1999,65765,451,90235,877,000996,0002,285,568
9Dec 17, 2024 16:1999,91162,974,63834,969,0001,998,0002,269,184