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 00:37Joad 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 00:3700000Error: expected "429496467379 ", got "211797619318 "
2May 7, 2024 00:4000000Error: expected "429496513851 ", got "263893227325 "
3May 7, 2024 00:4700000Error: expected "429496546698 ", got "237940986821 "
4May 7, 2024 00:4700000Error: expected "429496530006 ", got "225531711411 "