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 08:29DanielDanielScore: 139,711Success
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 08:29124,205118,034,21445,955,84602,224,128
2Jul 24, 2024 08:29125,973118,626,04546,610,10802,256,896
3Jul 24, 2024 08:29128,525107,627,40547,554,29202,199,552
4Jul 24, 2024 08:29137,71479,175,36649,955,000999,0002,420,736
5Jul 24, 2024 08:29137,89579,852,91150,021,0001,000,0002,461,696
6Jul 24, 2024 08:29138,25982,226,15249,150,0002,006,0002,502,656
7Jul 24, 2024 08:29139,71177,960,35350,680,0001,013,0002,416,640
8Jul 24, 2024 08:29140,32285,625,78550,921,000998,0002,367,488
9Jul 24, 2024 08:29140,54977,973,78050,003,0002,000,0002,383,872
10Jul 24, 2024 08:29141,25780,752,24050,255,0002,010,0002,322,432
11Jul 24, 2024 08:29141,70376,487,02451,422,0001,008,0002,363,392
12Jul 24, 2024 08:29142,26877,893,39449,603,0003,036,0002,318,336