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 5, 2022 21:51Franek KortaFranek KortaScore: 77,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2022 21:5176,81950,917,75025,378,0003,045,0002,281,472
2Aug 5, 2022 21:5176,96852,582,16225,427,0003,051,0002,281,472
3Aug 5, 2022 21:5177,00055,552,03226,455,0002,035,0002,273,280
4Aug 5, 2022 21:5177,04649,480,64127,489,0001,018,0002,527,232
5Aug 5, 2022 21:5177,04650,612,74527,489,0001,018,0002,281,472
6Aug 5, 2022 21:5177,09756,390,68625,470,0003,056,0002,269,184
7Aug 5, 2022 21:5177,28955,063,18826,555,0002,042,0002,531,328
8Aug 5, 2022 21:5177,43055,264,65527,626,0001,023,0002,281,472
9Aug 5, 2022 21:5178,27357,204,21626,964,0001,997,0002,281,472
10Aug 5, 2022 21:5182,23197,460,32930,425,63102,265,088
11Aug 5, 2022 21:5182,727110,071,26730,608,80902,256,896
12Aug 5, 2022 21:5182,96998,093,12530,698,44702,256,896