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 22, 2023 17:30mmalczakmmalczakScore: 199,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2023 18:24198,038131,543,95273,273,87602,265,088
2Sep 21, 2023 18:24199,376136,774,69773,769,13802,260,992
3Sep 22, 2023 17:30199,524128,242,47373,824,05802,277,376
4Sep 22, 2023 17:30199,637133,768,54073,865,56302,277,376
5Sep 21, 2023 18:24199,720135,827,77073,896,22202,273,280
6Sep 22, 2023 17:30200,731134,225,40174,270,61602,260,992