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:40mmalczakmmalczakScore: 76,379Success
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:4075,861103,353,01728,068,59102,265,088
2Sep 24, 2023 21:4076,058107,572,35328,141,33602,273,280
3Sep 24, 2023 21:4076,16087,581,45128,179,37102,265,088
4Sep 24, 2023 21:4576,379102,842,69028,260,31202,260,992
5Sep 24, 2023 21:4576,473102,773,64028,295,06202,256,896
6Sep 24, 2023 21:4576,47693,589,71328,296,25502,256,896