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 listMar 31, 2023 17:55Franek KortaFranek KortaScore: 192,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2023 17:55191,845135,550,85570,982,78302,289,664
2Mar 31, 2023 17:55192,026148,220,62771,049,47002,289,664
3Mar 31, 2023 17:55192,049139,001,56871,057,98702,293,760