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 listAug 6, 2022 19:50Franek KortaFranek KortaScore: 78,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 19:5077,93554,291,33425,853,0002,983,0002,281,472
2Aug 6, 2022 19:5077,95960,231,92226,856,0001,989,0002,281,472
3Aug 6, 2022 19:5078,13851,836,00226,918,0001,993,0002,523,136
4Aug 6, 2022 19:5078,17352,096,35225,932,0002,992,0002,531,328
5Aug 6, 2022 19:5078,18449,536,97025,936,0002,992,0002,281,472
6Aug 6, 2022 19:5078,19552,677,36626,937,0001,995,0002,285,568
7Aug 6, 2022 19:5078,23052,985,14726,949,0001,996,0002,269,184
8Aug 6, 2022 19:5078,44651,378,49827,024,0002,001,0002,527,232
9Aug 6, 2022 19:5078,58652,430,94127,072,0002,005,0002,281,472
10Aug 6, 2022 19:5083,00392,124,73230,711,02402,252,800
11Aug 6, 2022 19:5083,03099,793,96730,720,94802,260,992
12Aug 6, 2022 19:5083,259107,169,25530,805,80402,256,896