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 28, 2023 15:04apuxbtapuxbtScore: 180,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 15:05179,071124,459,15366,256,42702,269,184
2Sep 28, 2023 15:04179,605121,490,19466,453,91902,285,568
3Sep 28, 2023 15:04179,727150,478,46666,499,14102,187,264
4Sep 28, 2023 15:05179,931133,394,24366,574,54302,256,896
5Sep 28, 2023 15:05180,120125,764,07866,644,23402,260,992
6Sep 28, 2023 15:04180,302130,735,66266,711,87802,306,048
7Sep 28, 2023 15:04190,305134,196,90370,412,86702,199,552
8Sep 28, 2023 15:04190,818145,395,65870,602,66402,211,840
9Sep 28, 2023 15:04191,533144,755,09970,867,26802,273,280