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 listApr 9, 2023 17:13Franek KortaFranek KortaScore: 75,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 17:1373,42253,779,62726,160,0001,006,0002,269,184
2Apr 9, 2023 17:1374,33850,010,58026,487,0001,018,0002,420,736
3Apr 9, 2023 17:1374,34649,669,02227,508,00002,424,832
4Apr 9, 2023 17:1374,75755,548,26027,660,00002,428,928
5Apr 9, 2023 17:1375,28654,818,19325,867,0001,989,0002,265,088
6Apr 9, 2023 17:1375,47852,526,26924,935,0002,992,0002,433,024
7Apr 9, 2023 17:1375,61151,324,39623,980,0003,996,0002,428,928
8Apr 9, 2023 17:1376,01150,255,09927,120,0001,004,0002,506,752
9Apr 9, 2023 17:1378,04953,492,41626,887,0001,991,0002,428,928
10Apr 9, 2023 17:1382,08593,657,97330,371,43502,293,760
11Apr 9, 2023 17:1382,16989,989,75930,402,63002,297,856
12Apr 9, 2023 17:1382,96791,507,12330,697,70902,170,880