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 listAug 15, 2021 18:48Igor VolkovIgor VolkovScore: 100,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2021 18:4899,70864,071,56535,868,0001,024,0002,269,184
2Aug 15, 2021 18:4899,72760,737,01935,902,000997,0002,265,088
3Aug 15, 2021 18:4899,85464,295,20134,949,0001,997,0002,269,184
4Aug 15, 2021 18:48100,43260,543,88936,156,0001,004,0002,523,136
5Aug 15, 2021 18:48100,92395,754,16837,341,42302,273,280
6Aug 15, 2021 18:48100,93060,299,09836,335,0001,009,0002,289,664
7Aug 15, 2021 18:48100,96567,506,45835,338,0002,019,0002,289,664
8Aug 15, 2021 18:48101,08163,107,09635,379,0002,021,0002,265,088
9Aug 15, 2021 18:48101,392100,714,85937,514,86602,269,184
10Aug 15, 2021 18:48101,51158,934,98236,544,0001,015,0002,273,280
11Aug 15, 2021 18:48102,151101,750,33337,795,80102,265,088
12Aug 15, 2021 18:48102,35764,741,25236,849,0001,023,0002,269,184