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 9, 2023 17:06Franek KortaFranek KortaScore: 78,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 17:0675,47853,049,70026,930,000997,0002,527,232
2Apr 9, 2023 17:0676,64649,854,10427,347,0001,012,0002,269,184
3Apr 9, 2023 17:0676,77649,529,96527,393,0001,014,0002,527,232
4Apr 9, 2023 17:0677,95154,789,06726,853,0001,989,0002,531,328
5Apr 9, 2023 17:0677,98654,230,02726,865,0001,990,0002,265,088
6Apr 9, 2023 17:0678,27351,797,12626,964,0001,997,0002,441,216
7Apr 9, 2023 17:0678,31450,824,25327,977,000999,0002,531,328
8Apr 9, 2023 17:0678,31460,387,02527,942,0001,034,0002,531,328
9Apr 9, 2023 17:0678,35751,745,69927,993,000999,0002,527,232
10Apr 9, 2023 17:0682,07789,776,85630,368,59702,174,976
11Apr 9, 2023 17:0683,02197,837,89230,717,86702,289,664
12Apr 9, 2023 17:0683,499108,070,79730,894,59702,170,880