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 19:22Joad 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 19:1400000Error: expected "429496543528 ", got "429496540439 "stderr
2Nov 28, 2024 19:1500000Error: expected "429496543329 ", got "429496539819 "stderr
3Nov 28, 2024 19:1500000Error: expected "429496454615 ", got "412316605861 "stderr
4Nov 28, 2024 19:1600000Error: expected "429496635487 ", got "429496634003 "stderr
5Nov 28, 2024 19:1600000Error: expected "429496512627 ", got "420906588025 "stderr
6Nov 28, 2024 19:1600000Error: expected "429496488177 ", got "408021676787 "stderr
7Nov 28, 2024 19:2200000Error: expected "429496481433 ", got "425201519081 "stderr
8Nov 28, 2024 19:2200000Error: expected "429496537273 ", got "429496535404 "stderr
9Nov 28, 2024 19:2200000Error: expected "429496518635 ", got "429496515289 "stderr
10Nov 28, 2024 19:2200000Error: expected "429496469904 ", got "395136772204 "stderr
11Nov 28, 2024 19:2259,46542,584,72720,002,0002,000,0002,424,832
12Nov 28, 2024 19:2259,57843,516,02320,040,0002,004,0002,428,928
13Nov 28, 2024 19:2259,88646,918,33820,144,0002,014,0002,510,848