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 16, 2023 15:59mmalczakmmalczakScore: 98,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2023 15:5997,17358,724,67333,957,0001,997,0002,273,280
2Sep 16, 2023 15:5997,32257,195,06734,009,0002,000,0002,269,184
3Sep 16, 2023 15:5997,55161,970,52735,092,0001,002,0002,289,664
4Sep 16, 2023 15:5997,67061,165,80634,131,0002,007,0002,269,184
5Sep 16, 2023 15:5997,67661,408,79435,137,0001,003,0002,289,664
6Sep 16, 2023 15:5998,15464,496,24136,317,00002,281,472
7Sep 16, 2023 15:5998,29258,269,93834,348,0002,020,0002,289,664
8Sep 16, 2023 15:5998,84157,713,77235,556,0001,015,0002,277,376
9Sep 16, 2023 15:5998,93263,176,42535,589,0001,016,0002,277,376
10Sep 16, 2023 15:5999,180100,811,02136,696,69002,273,280
11Sep 16, 2023 15:59100,082102,566,82237,030,38302,265,088
12Sep 16, 2023 15:59100,623120,414,12337,230,62702,269,184