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 listJul 7, 2021 21:23Yuriy LyfenkoYuriy LyfenkoScore: 7,901,155Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2021 21:23241,780528,995,12789,458,757058,880,000
2Jul 7, 2021 21:23249,631586,609,14792,363,616063,221,760
3Jul 7, 2021 21:23260,899577,801,20896,532,791063,078,400
4Jul 7, 2021 21:237,901,1552,989,981,0482,923,427,34302,260,992
5Jul 7, 2021 21:238,219,6883,108,417,4653,041,284,43602,228,224
6Jul 7, 2021 21:239,377,9323,519,405,4573,469,834,71002,277,376