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 01:10Joad NacerJoad NacerError
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 01:1000000Error: expected "429496553053 ", got "429496512975 "stderr
2May 7, 2024 01:1100000Error: expected "429496491126 ", got "313532484941 "stderr
3May 7, 2024 01:1200000Error: expected "429496531857 ", got "382251935429 "stderr
4May 7, 2024 01:1300000Error: expected "429496530617 ", got "425201567441 "stderr
5May 7, 2024 01:1300000Error: expected "429496524075 ", got "425201560920 "stderr