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 listJul 13, 2021 16:34Yuriy LyfenkoYuriy LyfenkoScore: 107,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 16:34106,43560,592,33238,372,0001,009,0002,334,720
2Jul 13, 2021 16:34106,54658,808,54138,412,0001,010,0002,334,720
3Jul 13, 2021 16:34106,81962,621,60438,510,0001,013,0002,523,136
4Jul 13, 2021 16:34106,91967,133,37638,546,0001,014,0002,523,136
5Jul 13, 2021 16:34106,92466,846,22137,534,0002,028,0002,334,720
6Jul 13, 2021 16:34106,97365,837,70137,551,0002,029,0002,326,528
7Jul 13, 2021 16:34107,00368,069,98637,561,0002,030,0002,334,720
8Jul 13, 2021 16:34107,03066,348,79238,586,0001,015,0002,334,720
9Jul 13, 2021 16:34107,08165,375,58137,589,0002,031,0002,334,720
10Jul 13, 2021 16:34108,686102,505,56940,213,86502,187,264
11Jul 13, 2021 16:34109,347111,260,94240,458,25602,191,360
12Jul 13, 2021 16:34109,503101,996,93640,516,25002,187,264