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 25, 2023 21:50mmalczakmmalczakScore: 74,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2023 21:5073,89387,531,58727,340,37802,269,184
2Sep 25, 2023 21:5073,993104,325,02327,377,51402,269,184
3Sep 25, 2023 21:5474,009100,747,73927,383,16802,260,992
4Sep 25, 2023 21:5474,298102,630,08727,490,20102,269,184
5Sep 25, 2023 21:5474,31597,928,50327,496,59902,269,184
6Sep 25, 2023 21:5074,417105,747,70527,534,32702,260,992