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 1, 2021 10:47Ilya AniskovetsIlya AniskovetsScore: 119,062Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2021 10:47118,57672,578,48842,853,0001,020,0002,289,664
2Nov 1, 2021 10:47118,69574,039,33641,921,0001,996,0002,289,664
3Nov 1, 2021 10:47118,93571,781,97642,006,0002,000,0002,289,664
4Nov 1, 2021 10:47118,96567,297,02743,017,0001,000,0002,277,376
5Nov 1, 2021 10:47119,00567,255,00742,031,0002,001,0002,273,280
6Nov 1, 2021 10:47119,02468,878,65943,039,0001,000,0002,289,664
7Nov 1, 2021 10:47119,06265,883,01442,051,0002,002,0002,289,664
8Nov 1, 2021 10:47119,28671,854,42842,130,0002,006,0002,273,280
9Nov 1, 2021 10:47119,30068,515,92842,135,0002,006,0002,269,184
10Nov 1, 2021 10:47121,488101,294,09244,950,46902,260,992
11Nov 1, 2021 10:47121,743105,340,36845,044,76802,269,184
12Nov 1, 2021 10:47122,624108,138,26845,370,93602,269,184