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 listApr 3, 2023 21:29Yurkov AlekseyYurkov AlekseyScore: 99,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 21:2997,91960,171,49334,218,0002,012,0002,289,664
2Apr 3, 2023 21:2998,06562,186,04334,269,0002,015,0002,289,664
3Apr 3, 2023 21:2998,75161,966,51635,524,0001,014,0002,289,664
4Apr 3, 2023 21:2999,53562,661,54234,838,0001,990,0002,289,664
5Apr 3, 2023 21:2999,57664,084,67534,852,0001,991,0002,289,664
6Apr 3, 2023 21:2999,57862,473,44335,849,000995,0002,281,472
7Apr 3, 2023 21:2999,889100,998,00236,958,95002,269,184
8Apr 3, 2023 21:29100,11960,086,36235,042,0002,002,0002,289,664
9Apr 3, 2023 21:29100,20362,256,86635,071,0002,004,0002,289,664
10Apr 3, 2023 21:29100,22260,636,35935,078,0002,004,0002,289,664
11Apr 3, 2023 21:29100,536104,023,61237,198,17102,260,992
12Apr 3, 2023 21:29101,619116,793,11437,598,92002,260,992