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 17:48Joad 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 17:4800000Error: expected "429496503388 ", got "429496501186 "stderr
2Nov 28, 2024 17:4800000Error: expected "429496504787 ", got "429496501829 "stderr
3Nov 28, 2024 17:4800000Error: expected "429496551001 ", got "429496529901 "stderr
4Nov 28, 2024 17:4800000Error: expected "429496527468 ", got "429496523402 "stderr
5Nov 28, 2024 17:4800000Error: expected "429496488138 ", got "429496485979 "stderr