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:13Franek KortaFranek KortaScore: 77,351Success
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:1376,70555,513,97426,354,0002,027,0002,392,064
2Aug 5, 2022 21:1376,84351,426,19125,386,0003,046,0002,281,472
3Aug 5, 2022 21:1376,87654,359,66927,429,0001,015,0002,281,472
4Aug 5, 2022 21:1376,94651,617,84528,470,00002,285,568
5Aug 5, 2022 21:1377,02453,363,94927,482,0001,017,0002,531,328
6Aug 5, 2022 21:1377,29256,132,01628,598,00002,281,472
7Aug 5, 2022 21:1377,35154,634,24126,576,0002,044,0002,281,472
8Aug 5, 2022 21:1377,43853,532,01927,629,0001,023,0002,281,472
9Aug 5, 2022 21:1377,63853,660,26227,701,0001,025,0002,281,472
10Aug 5, 2022 21:1382,84293,932,17530,651,55302,273,280
11Aug 5, 2022 21:1382,88291,128,38330,666,24602,256,896
12Aug 5, 2022 21:1383,694104,947,94930,966,84002,265,088