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 listMay 10, 2024 00:50Joad NacerJoad NacerScore: 68,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2024 00:5068,59089,849,24625,378,43602,273,280
2May 10, 2024 00:5068,70996,467,22525,422,50702,277,376
3May 10, 2024 00:5068,83889,958,45825,469,90202,273,280