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 12:33Joad NacerJoad NacerScore: 68,666Success
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 12:3368,63188,702,67025,393,37902,273,280
2May 7, 2024 12:3368,666103,012,72025,406,60202,273,280
3May 7, 2024 12:3368,98196,820,53325,522,98602,269,184