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 16:25Yuriy LyfenkoYuriy LyfenkoScore: 107,097Success
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 16:25106,34161,550,84336,320,0003,026,0002,523,136
2Jul 13, 2021 16:25106,42463,460,01137,358,0002,019,0002,519,040
3Jul 13, 2021 16:25106,88662,234,91737,520,0002,028,0002,330,624
4Jul 13, 2021 16:25106,89262,797,28938,536,0001,014,0002,326,528
5Jul 13, 2021 16:25106,97367,085,91538,566,0001,014,0002,523,136
6Jul 13, 2021 16:25107,01965,027,87637,567,0002,030,0002,326,528
7Jul 13, 2021 16:25107,09776,612,39237,594,0002,032,0002,523,136
8Jul 13, 2021 16:25107,13867,049,17638,625,0001,016,0002,334,720
9Jul 13, 2021 16:25107,19764,217,40338,646,0001,017,0002,330,624
10Jul 13, 2021 16:25109,39898,801,78440,477,33502,183,168
11Jul 13, 2021 16:25109,69098,843,83040,585,45202,183,168
12Jul 13, 2021 16:25109,98198,638,39840,692,85902,187,264