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 28, 2023 21:17Franek KortaFranek KortaScore: 72,781Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 21:1772,20552,676,18226,716,00002,445,312
2Aug 28, 2023 21:1772,27048,326,59125,750,000990,0002,527,232
3Aug 28, 2023 21:1772,28954,517,29724,766,0001,981,0002,441,216
4Aug 28, 2023 21:1772,47652,956,34925,823,000993,0002,531,328
5Aug 28, 2023 21:1772,61158,606,93225,871,000995,0002,441,216
6Aug 28, 2023 21:1772,66550,657,68425,891,000995,0002,441,216
7Aug 28, 2023 21:1772,78149,870,99924,935,0001,994,0002,441,216
8Aug 28, 2023 21:1773,03052,685,18726,021,0001,000,0002,527,232
9Aug 28, 2023 21:1773,17349,745,42525,069,0002,005,0002,531,328
10Aug 28, 2023 21:1774,90186,873,06727,713,52002,285,568
11Aug 28, 2023 21:1775,23284,743,86527,835,82002,281,472
12Aug 28, 2023 21:1775,87297,459,92728,072,58402,277,376