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 20, 2023 19:52mmalczakmmalczakScore: 84,727Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2023 19:5283,41956,425,07028,874,0001,991,0002,523,136
2Sep 20, 2023 19:5283,42455,539,18729,872,000995,0002,289,664
3Sep 20, 2023 19:5283,75754,437,59429,991,000999,0002,277,376
4Sep 20, 2023 19:5283,81159,813,14930,010,0001,000,0002,289,664
5Sep 20, 2023 19:5284,51958,382,36030,264,0001,008,0002,277,376
6Sep 20, 2023 19:5284,55458,258,25430,276,0001,009,0002,277,376
7Sep 20, 2023 19:5284,72758,544,38029,327,0002,022,0002,289,664
8Sep 20, 2023 19:5284,96554,977,38930,423,0001,014,0002,289,664
9Sep 20, 2023 19:5285,08454,685,72130,466,0001,015,0002,531,328
10Sep 20, 2023 19:5285,98389,595,71131,813,83902,265,088
11Sep 20, 2023 19:5286,900107,958,07332,153,10702,277,376
12Sep 20, 2023 19:5286,91392,664,40632,157,95002,269,184