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 27, 2024 00:05Joad 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 27, 2024 00:0500000Error: expected "429496501903 ", got "360769343578 "
2May 27, 2024 00:0600000Error: expected "429496530501 ", got "360777080600 "
3May 27, 2024 00:0700000Error: expected "429496522673 ", got "386546859962 "