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 12, 2021 21:38piculpiculScore: 184,383Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2021 21:38184,343127,152,31568,206,90102,195,456
2Sep 12, 2021 21:38184,383124,538,34168,221,65302,179,072
3Sep 12, 2021 21:38185,374130,143,89868,588,48902,301,952