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:58Joad 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:5800000Error: expected "429496454764 ", got "271688460 "stderr
2Nov 28, 2024 17:5900000Error: expected "429496464502 ", got "304430844 "stderr
3Nov 28, 2024 17:5900000Error: expected "429496544023 ", got "359235164 "stderr
4Nov 28, 2024 17:5900000Error: expected "429496513014 ", got "370462792 "stderr
5Nov 28, 2024 17:5900000Error: expected "429496453030 ", got "268860752 "stderr
6Nov 28, 2024 18:0000000Error: expected "429496440143 ", got "189688112 "stderr
7Nov 28, 2024 18:0000000Error: expected "429496561033 ", got "415433656 "stderr
8Nov 28, 2024 18:0300000Error: expected "429496558198 ", got "408018716 "stderr
9Nov 28, 2024 18:0300000Error: expected "429496542251 ", got "403263416 "stderr
10Nov 28, 2024 18:0300000Error: expected "429496546787 ", got "395765916 "stderr
11Nov 28, 2024 18:0400000Error: expected "429496489420 ", got "317601200 "stderr
12Nov 28, 2024 18:0400000Error: expected "429496526844 ", got "374766112 "stderr
13Nov 28, 2024 18:0400000Error: expected "429496528145 ", got "311460912 "stderr