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 7, 2024 23:40Joad NacerJoad NacerScore: 69,070Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2024 23:4068,488122,707,64325,340,56702,277,376
2May 7, 2024 23:4069,07092,860,55025,555,79302,277,376
3May 7, 2024 23:4069,35985,595,47025,662,69902,269,184