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 listJun 16, 2024 07:43CemaCemaScore: 111,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2024 07:43110,82462,671,40239,005,0002,000,0002,289,664
2Jun 16, 2024 07:43110,91467,981,01639,037,0002,001,0002,289,664
3Jun 16, 2024 07:43111,029111,350,45741,080,59402,265,088
4Jun 16, 2024 07:43111,14668,194,79540,121,0001,003,0002,273,280
5Jun 16, 2024 07:43111,32464,928,54739,181,0002,009,0002,269,184
6Jun 16, 2024 07:43111,34365,758,84339,188,0002,009,0002,289,664
7Jun 16, 2024 07:43111,72467,169,45139,322,0002,016,0002,269,184
8Jun 16, 2024 07:43111,877125,651,33141,394,55102,265,088
9Jun 16, 2024 07:43112,02764,090,70039,477,0001,973,0002,289,664
10Jun 16, 2024 07:43112,41670,305,18840,580,0001,014,0002,289,664
11Jun 16, 2024 07:43112,46568,130,48340,598,0001,014,0002,523,136
12Jun 16, 2024 07:43112,879107,330,84741,765,17502,269,184