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 22:17mmalczakmmalczakScore: 74,416Success
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 22:1774,05499,863,83227,400,01602,265,088
2Sep 25, 2023 22:2274,115100,731,02727,422,43602,265,088
3Sep 25, 2023 22:1774,279102,543,40327,483,33202,265,088
4Sep 25, 2023 22:1774,41694,350,57527,533,76302,269,184
5Sep 25, 2023 22:2274,72988,379,38927,649,66402,269,184
6Sep 25, 2023 22:2275,37199,412,73727,887,27702,273,280