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 listAug 1, 2022 22:10Franek KortaFranek KortaScore: 131,158Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2022 22:10130,942116,536,58048,448,65402,256,896
2Aug 1, 2022 22:10131,158109,395,21348,528,34802,256,896
3Aug 1, 2022 22:10131,218112,462,65448,550,71502,265,088