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 2, 2024 21:57mebowlermebowlerScore: 362,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 2, 2024 21:36358,824162,152,88785,848,00046,917,0002,285,568
2Dec 2, 2024 21:36359,238159,438,87285,947,00046,971,0002,285,568
3Dec 2, 2024 21:36359,419162,837,27084,991,00047,994,0002,285,568
4Dec 2, 2024 21:36361,773157,702,14881,912,00051,944,0002,457,600
5Dec 2, 2024 21:36362,068164,588,00385,978,00047,987,0002,478,080
6Dec 2, 2024 21:57362,114159,455,14284,989,00048,993,0002,285,568
7Dec 2, 2024 21:36362,273158,085,78987,027,00047,014,0002,461,696
8Dec 2, 2024 21:36362,449165,548,13585,067,00049,039,0002,404,352
9Dec 2, 2024 21:36362,630160,578,38285,110,00049,063,0002,285,568
10Dec 2, 2024 21:36363,019157,708,73586,204,00048,113,0002,461,696
11Dec 2, 2024 21:57363,278165,921,06985,262,00049,151,0002,285,568
12Dec 2, 2024 21:57364,219162,070,96981,855,00052,906,0002,445,312