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 15, 2021 23:00Yurkov AlekseyYurkov AlekseyScore: 98,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2021 23:0097,55457,770,52634,090,0002,005,0002,289,664
2Jul 15, 2021 23:0097,71658,653,47636,155,00002,269,184
3Jul 15, 2021 23:0097,99559,285,07034,244,0002,014,0002,269,184
4Jul 15, 2021 23:0098,03259,016,23434,257,0002,015,0002,273,280
5Jul 15, 2021 23:0098,69559,167,68035,503,0001,014,0002,289,664
6Jul 15, 2021 23:0098,92264,262,62435,585,0001,016,0002,277,376
7Jul 15, 2021 23:0098,94664,536,70136,610,00002,265,088
8Jul 15, 2021 23:0099,125113,303,20236,676,21202,269,184
9Jul 15, 2021 23:0099,17368,031,68434,711,0001,983,0002,289,664
10Jul 15, 2021 23:0099,353129,565,31236,760,47602,273,280
11Jul 15, 2021 23:0099,50068,281,88834,825,0001,990,0002,289,664
12Jul 15, 2021 23:00100,61589,525,15137,227,50002,269,184