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 listSep 21, 2023 18:55mmalczakmmalczakScore: 84,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2023 18:5582,88960,096,53229,647,0001,022,0002,289,664
2Sep 21, 2023 18:5583,07858,747,71929,748,000991,0002,281,472
3Sep 21, 2023 18:5583,35757,462,11329,848,000994,0002,289,664
4Sep 21, 2023 18:5583,61157,353,29328,941,0001,995,0002,289,664
5Sep 21, 2023 18:5583,65951,242,50228,957,0001,997,0002,289,664
6Sep 21, 2023 18:5583,97054,078,40629,065,0002,004,0002,273,280
7Sep 21, 2023 18:5584,15452,880,31729,129,0002,008,0002,289,664
8Sep 21, 2023 18:5584,60354,085,31629,284,0002,019,0002,289,664
9Sep 21, 2023 18:5585,01656,150,11630,442,0001,014,0002,289,664
10Sep 21, 2023 18:5585,77988,353,42731,738,23802,273,280
11Sep 21, 2023 18:5585,95594,120,07331,803,21002,265,088
12Sep 21, 2023 18:5586,289103,360,41031,927,07402,273,280