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 2, 2022 12:52Yuriy LyfenkoYuriy LyfenkoScore: 61,851Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 12:5261,486548,469,32721,761,000989,0002,281,472
2Aug 2, 2022 12:5261,497549,939,21220,776,0001,978,0002,273,280
3Aug 2, 2022 12:5261,622550,392,63820,818,0001,982,0002,281,472
4Aug 2, 2022 12:5261,708546,306,47121,840,000992,0002,289,664
5Aug 2, 2022 12:5261,768548,732,11020,867,0001,987,0002,281,472
6Aug 2, 2022 12:5261,808545,524,13920,881,0001,988,0002,285,568
7Aug 2, 2022 12:5261,851547,761,96620,895,0001,990,0002,281,472
8Aug 2, 2022 12:5261,903551,420,10020,913,0001,991,0002,531,328
9Aug 2, 2022 12:5261,914547,778,41420,916,0001,992,0002,281,472
10Aug 2, 2022 12:5264,018594,798,15523,686,56002,260,992
11Aug 2, 2022 12:5264,285584,842,68623,785,49702,252,800
12Aug 2, 2022 12:5264,441586,877,45523,843,29102,273,280