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 6, 2024 23:52Joad NacerJoad NacerScore: 78,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2024 23:5278,57884,985,16129,073,83002,273,280
2May 6, 2024 23:5278,73994,323,82829,133,55002,260,992
3May 6, 2024 23:5279,03092,539,97629,241,06902,260,992