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 15, 2021 16:58piculpiculScore: 141,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 16:58138,794113,202,04251,353,72802,252,800
2Sep 15, 2021 16:58139,317114,048,10651,547,37702,256,896
3Sep 15, 2021 16:58140,757122,049,03052,079,95402,260,992
4Sep 15, 2021 16:58141,447113,798,66352,335,48202,256,896
5Sep 15, 2021 16:58141,498116,101,96252,354,29502,260,992
6Sep 15, 2021 16:58141,893123,718,07452,500,53502,256,896