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 listNov 28, 2024 18:07Joad 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
1Nov 28, 2024 18:0700000Error: expected "429496461501 ", got "399431726351 "stderr
2Nov 28, 2024 18:0700000Error: expected "429496457144 ", got "425201494791 "stderr
3Nov 28, 2024 18:0700000Error: expected "429496431906 ", got "352187116249 "stderr
4Nov 28, 2024 18:0900000Error: expected "429496478316 ", got "416611591397 "stderr
5Nov 28, 2024 18:0900000Error: expected "429496472550 ", got "425201510212 "stderr