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 24, 2024 17:20AnSaAnSaScore: 74,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2024 17:2074,36545,890,71026,496,0001,019,0002,523,136
2Jul 24, 2024 17:2074,42450,126,24826,518,0001,019,0002,277,376
3Jul 24, 2024 17:2074,44954,364,09725,506,0002,040,0002,277,376
4Jul 24, 2024 17:2074,56255,557,99726,567,0001,021,0002,281,472
5Jul 24, 2024 17:2074,64154,843,95826,595,0001,022,0002,277,376
6Jul 24, 2024 17:2074,75953,438,43725,612,0002,049,0002,277,376
7Jul 24, 2024 17:2074,90851,396,50326,690,0001,026,0002,281,472
8Jul 24, 2024 17:2075,19758,646,13023,849,0003,974,0002,277,376
9Jul 24, 2024 17:2075,24658,236,57725,853,0001,988,0002,277,376
10Jul 24, 2024 17:2078,69296,249,74729,116,11202,269,184
11Jul 24, 2024 17:2078,91397,028,79729,197,75502,256,896
12Jul 24, 2024 17:2079,600106,583,20529,451,99202,269,184