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 13, 2021 18:51Yuriy LyfenkoYuriy LyfenkoScore: 64,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 18:5164,162547,088,45921,762,0001,978,0002,281,472
2Jul 13, 2021 18:5164,227549,550,03521,784,0001,980,0002,281,472
3Jul 13, 2021 18:5164,257551,961,77022,785,000990,0002,285,568
4Jul 13, 2021 18:5164,268558,620,07021,798,0001,981,0002,285,568
5Jul 13, 2021 18:5164,432547,504,64321,854,0001,986,0002,285,568
6Jul 13, 2021 18:5164,465546,458,42021,865,0001,987,0002,281,472
7Jul 13, 2021 18:5164,470545,757,45322,861,000993,0002,281,472
8Jul 13, 2021 18:5164,516548,290,45621,882,0001,989,0002,281,472
9Jul 13, 2021 18:5164,532546,281,34321,888,0001,989,0002,285,568
10Jul 13, 2021 18:5166,775581,539,61424,706,70802,240,512
11Jul 13, 2021 18:5166,869585,141,89024,741,60702,265,088
12Jul 13, 2021 18:5167,192585,080,00224,861,11902,265,088