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:58mmalczakmmalczakScore: 74,362Success
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:5873,94492,363,97327,359,12302,273,280
2Sep 25, 2023 21:5974,046104,630,75027,396,95002,265,088
3Sep 25, 2023 21:5874,09289,116,91427,414,19402,260,992
4Sep 25, 2023 21:5974,36297,914,90727,513,81002,269,184
5Sep 25, 2023 21:5974,78487,659,45327,669,95502,265,088
6Sep 25, 2023 21:5875,17592,509,20227,814,62102,269,184