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 9, 2021 19:19Yurkov AlekseyYurkov AlekseyScore: 122,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2021 19:19121,72470,612,41543,037,0002,001,0002,273,280
2Jul 9, 2021 19:19121,73567,853,78643,041,0002,001,0002,269,184
3Jul 9, 2021 19:19121,78666,348,71743,059,0002,002,0002,289,664
4Jul 9, 2021 19:19121,91467,667,90443,104,0002,004,0002,289,664
5Jul 9, 2021 19:19122,01971,354,10643,141,0002,006,0002,277,376
6Jul 9, 2021 19:19122,08671,790,41843,165,0002,007,0002,269,184
7Jul 9, 2021 19:19122,22274,719,40343,213,0002,009,0002,289,664
8Jul 9, 2021 19:19122,24166,568,87343,219,0002,010,0002,273,280
9Jul 9, 2021 19:19122,721102,098,26945,406,66602,265,088
10Jul 9, 2021 19:19122,786114,424,70445,430,97702,265,088
11Jul 9, 2021 19:19122,88167,093,72444,456,0001,010,0002,289,664
12Jul 9, 2021 19:19123,088117,542,71945,542,47502,265,088