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 26, 2024 23:59Joad NacerJoad NacerScore: 73,521Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2024 23:5973,239100,390,91027,098,56102,260,992
2May 26, 2024 23:5973,52199,342,65327,202,58702,269,184
3May 26, 2024 23:5973,68997,611,10827,264,74702,269,184