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 21, 2021 18:15Yuriy LyfenkoYuriy LyfenkoScore: 61,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2021 18:1561,019547,374,51121,551,0001,026,0002,289,664
2Aug 21, 2021 18:1561,076549,559,37221,571,0001,027,0002,285,568
3Aug 21, 2021 18:1561,084547,150,96421,574,0001,027,0002,281,472
4Aug 21, 2021 18:1561,392550,955,85020,740,0001,975,0002,289,664
5Aug 21, 2021 18:1561,397549,596,49121,730,000987,0002,285,568
6Aug 21, 2021 18:1561,430550,081,47621,741,000988,0002,285,568
7Aug 21, 2021 18:1561,514551,586,60621,771,000989,0002,289,664
8Aug 21, 2021 18:1561,530547,958,92720,787,0001,979,0002,285,568
9Aug 21, 2021 18:1561,532551,107,37721,778,000989,0002,289,664
10Aug 21, 2021 18:1564,177589,055,12923,745,62502,252,800
11Aug 21, 2021 18:1564,227581,883,29723,764,15802,252,800
12Aug 21, 2021 18:1564,259592,323,82723,775,66402,252,800