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 listSep 19, 2023 07:40mmalczakmmalczakScore: 84,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2023 07:4082,92259,369,36229,659,0001,022,0002,285,568
2Sep 19, 2023 07:4082,98955,106,74830,706,00002,285,568
3Sep 19, 2023 07:4083,30056,371,90628,833,0001,988,0002,277,376
4Sep 19, 2023 07:4083,36860,209,54829,851,000995,0002,285,568
5Sep 19, 2023 07:4083,37861,095,36029,855,000995,0002,285,568
6Sep 19, 2023 07:4083,64658,916,17228,953,0001,996,0002,277,376
7Sep 19, 2023 07:4084,14354,647,09029,125,0002,008,0002,285,568
8Sep 19, 2023 07:4084,24152,949,77729,159,0002,010,0002,273,280
9Sep 19, 2023 07:4084,47357,649,06630,247,0001,008,0002,285,568
10Sep 19, 2023 07:4085,32396,632,06431,569,35702,248,704
11Sep 19, 2023 07:4085,93096,893,35331,794,09102,244,608
12Sep 19, 2023 07:4087,16696,269,83932,251,33402,248,704