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 listJul 7, 2021 21:24Yuriy LyfenkoYuriy LyfenkoScore: 932,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2021 21:24243,138511,549,80189,961,241059,932,672
2Jul 7, 2021 21:24253,869593,656,53693,931,603060,321,792
3Jul 7, 2021 21:24263,380622,428,30897,450,709066,637,824
4Jul 7, 2021 21:24932,625395,783,356345,071,39802,293,760
5Jul 7, 2021 21:242,450,826988,233,366906,805,44402,240,512
6Jul 7, 2021 21:242,787,1551,110,546,4421,031,247,36102,265,088