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 24, 2023 21:35mmalczakmmalczakScore: 75,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2023 21:3575,016124,208,43227,755,73502,269,184
2Sep 24, 2023 21:3575,13189,901,07127,798,44802,269,184
3Sep 24, 2023 21:3575,227102,010,74827,833,91502,269,184
4Sep 24, 2023 21:3575,45196,139,50327,916,73302,260,992
5Sep 24, 2023 21:3575,593106,305,00727,969,30102,256,896
6Sep 24, 2023 21:3575,61489,826,30827,977,30502,260,992