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:43Franek KortaFranek KortaScore: 154,171Success
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:43154,115112,649,34157,022,55802,260,992
2Aug 14, 2022 19:43154,171124,552,29157,043,29002,273,280
3Aug 14, 2022 19:43154,310115,399,05657,094,76002,265,088