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:06AnSaAnSaScore: 72,514Success
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:0671,99249,976,91725,613,0001,024,0002,527,232
2Jul 24, 2024 17:0672,14656,488,28823,614,0003,080,0002,277,376
3Jul 24, 2024 17:0672,16253,022,84224,647,0002,053,0002,269,184
4Jul 24, 2024 17:0672,18456,656,39825,681,0001,027,0002,277,376
5Jul 24, 2024 17:0672,25951,238,86326,736,00002,514,944
6Jul 24, 2024 17:0672,48152,650,86323,839,0002,979,0002,277,376
7Jul 24, 2024 17:0672,51453,206,85123,849,0002,981,0002,277,376
8Jul 24, 2024 17:0672,57854,654,90824,865,0001,989,0002,277,376
9Jul 24, 2024 17:0672,74354,848,11223,925,0002,990,0002,277,376
10Jul 24, 2024 17:0677,17596,683,57728,554,75402,256,896
11Jul 24, 2024 17:0677,31288,815,82228,605,59302,260,992
12Jul 24, 2024 17:0677,57689,944,42528,703,06202,260,992