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 listOct 24, 2022 21:01Kenneth MaplesKenneth MaplesScore: 74,681Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2022 21:0174,09752,120,94526,401,0001,015,0002,277,376
2Oct 24, 2022 21:0174,17051,780,52926,427,0001,016,0002,277,376
3Oct 24, 2022 21:0174,31650,486,93326,479,0001,018,0002,277,376
4Oct 24, 2022 21:0174,35149,341,19724,454,0003,056,0002,363,392
5Oct 24, 2022 21:0174,37649,896,14626,500,0001,019,0002,506,752
6Oct 24, 2022 21:0174,66552,803,04927,626,00002,494,464
7Oct 24, 2022 21:0174,68156,802,52923,539,0004,093,0002,498,560
8Oct 24, 2022 21:0174,70551,717,87126,618,0001,023,0002,277,376
9Oct 24, 2022 21:0174,75154,463,60726,634,0001,024,0002,347,008
10Oct 24, 2022 21:0178,578104,748,03029,073,82602,207,744
11Oct 24, 2022 21:0178,69992,310,98029,118,76402,215,936
12Oct 24, 2022 21:0178,790101,888,71929,152,19502,232,320