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 21:16Joad 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 6, 2024 21:1600000Error: expected "429496483632 ", got "38263393128 "
2May 6, 2024 21:1600000Error: expected "429496554161 ", got "180395711164 "
3May 6, 2024 21:1700000Error: expected "429496563625 ", got "138790607677 "
4May 6, 2024 21:1700000Error: expected "429496503268 ", got "11686623770 "
5May 6, 2024 21:1800000Error: expected "429496539862 ", got "161923215219 "
6May 6, 2024 21:1800000Error: expected "429496552317 ", got "112005290356 "
7May 6, 2024 21:1800000Error: expected "429496510033 ", got "156611572359 "