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:54Franek KortaFranek KortaScore: 191,842Success
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:54191,669155,878,32770,917,46002,293,760
2Mar 31, 2023 17:54191,842144,820,38770,981,36802,281,472
3Mar 31, 2023 17:54191,978139,777,05871,031,89702,289,664