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 listMar 25, 2023 20:39Yurkov AlekseyYurkov AlekseyScore: 98,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2023 20:3997,26259,095,19933,988,0001,999,0002,289,664
2Mar 25, 2023 20:3997,33065,147,20634,012,0002,000,0002,289,664
3Mar 25, 2023 20:3997,69758,634,04434,140,0002,008,0002,289,664
4Mar 25, 2023 20:3998,50865,783,07035,436,0001,012,0002,523,136
5Mar 25, 2023 20:3998,52263,553,81934,428,0002,025,0002,531,328
6Mar 25, 2023 20:3998,59557,812,10835,467,0001,013,0002,289,664
7Mar 25, 2023 20:3998,84662,025,59135,558,0001,015,0002,269,184
8Mar 25, 2023 20:3998,86265,300,63734,602,0001,977,0002,289,664
9Mar 25, 2023 20:3998,92395,612,15736,601,42302,260,992
10Mar 25, 2023 20:3999,408114,228,83736,780,81302,265,088
11Mar 25, 2023 20:3999,60065,416,19335,856,000996,0002,289,664
12Mar 25, 2023 20:39100,124106,954,47237,045,91702,265,088