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 14, 2022 19:39Franek KortaFranek KortaScore: 160,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2022 19:39159,979120,477,77859,192,30302,297,856
2Aug 14, 2022 19:39160,643130,993,07459,437,82602,174,976
3Aug 14, 2022 19:39163,274134,517,37960,411,51002,293,760