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 8, 2021 21:38Yurkov AlekseyYurkov AlekseyScore: 105,022Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 21:38104,26270,816,78437,562,0001,015,0002,289,664
2Jul 8, 2021 21:38104,32264,365,05737,584,0001,015,0002,375,680
3Jul 8, 2021 21:38104,59764,530,12536,717,0001,984,0002,273,280
4Jul 8, 2021 21:38104,70566,235,49637,722,0001,019,0002,289,664
5Jul 8, 2021 21:38104,95968,805,64536,844,0001,991,0002,269,184
6Jul 8, 2021 21:38104,99563,739,37836,856,0001,992,0002,273,280
7Jul 8, 2021 21:38105,02262,052,99937,862,000996,0002,289,664
8Jul 8, 2021 21:38105,26863,157,48837,951,000998,0002,375,680
9Jul 8, 2021 21:38105,62460,530,51037,077,0002,004,0002,392,064
10Jul 8, 2021 21:38133,278137,213,12849,312,88702,273,280
11Jul 8, 2021 21:38133,284115,945,58549,315,13502,277,376
12Jul 8, 2021 21:38133,728111,664,93749,479,40702,265,088