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 19, 2023 08:02mmalczakmmalczakScore: 85,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2023 08:0284,38153,672,06429,207,0002,014,0002,289,664
2Sep 19, 2023 08:0284,40053,490,24829,214,0002,014,0002,289,664
3Sep 19, 2023 08:0284,40854,639,79630,224,0001,007,0002,273,280
4Sep 19, 2023 08:0284,65153,723,84031,321,00002,289,664
5Sep 19, 2023 08:0284,92756,401,00529,396,0002,027,0002,289,664
6Sep 19, 2023 08:0285,35458,289,60630,563,0001,018,0002,265,088
7Sep 19, 2023 08:0285,36858,439,01330,568,0001,018,0002,375,680
8Sep 19, 2023 08:0285,47856,583,10731,627,00002,289,664
9Sep 19, 2023 08:0286,499112,578,69632,004,70202,269,184
10Sep 19, 2023 08:0286,90057,070,99130,144,0002,009,0002,289,664
11Sep 19, 2023 08:0287,12389,837,57332,235,66702,252,800
12Sep 19, 2023 08:0287,211117,730,94932,268,02602,260,992