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:19Yuriy LyfenkoYuriy LyfenkoScore: 61,862Success
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:1961,524549,537,90522,764,00002,281,472
2Aug 21, 2021 18:1961,554547,591,52220,795,0001,980,0002,281,472
3Aug 21, 2021 18:1961,608549,844,32921,759,0001,036,0002,281,472
4Aug 21, 2021 18:1961,730551,451,60620,854,0001,986,0002,285,568
5Aug 21, 2021 18:1961,797546,649,53420,877,0001,988,0002,289,664
6Aug 21, 2021 18:1961,803542,838,97420,879,0001,988,0002,289,664
7Aug 21, 2021 18:1961,862544,284,49621,894,000995,0002,281,472
8Aug 21, 2021 18:1961,900543,387,92820,912,0001,991,0002,281,472
9Aug 21, 2021 18:1962,003547,721,11220,947,0001,994,0002,285,568
10Aug 21, 2021 18:1964,512576,397,67523,869,32402,265,088
11Aug 21, 2021 18:1964,655587,227,98423,922,16702,260,992
12Aug 21, 2021 18:1964,682589,593,34623,932,29102,252,800