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 5, 2024 07:01Alexis EngelkeAlexis EngelkeScore: 21,571,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2024 07:0121,429,7087,963,845,2607,741,135,000187,857,0002,281,472
2Oct 5, 2024 07:0121,535,3037,995,477,2857,764,214,000203,848,0002,306,048
3Oct 5, 2024 07:0121,564,8248,015,483,2117,782,134,000196,851,0002,281,472
4Oct 5, 2024 07:0121,569,6058,010,025,9267,802,894,000177,860,0002,301,952
5Oct 5, 2024 07:0121,571,5498,015,622,2677,777,640,000203,833,0002,310,144
6Oct 5, 2024 07:0121,580,8958,020,557,9207,800,072,000184,859,0002,281,472
7Oct 5, 2024 07:0121,597,5768,023,986,7667,807,239,000183,864,0002,445,312
8Oct 5, 2024 07:0121,642,6328,040,867,9467,812,926,000194,848,0002,281,472
9Oct 5, 2024 07:0121,682,2358,062,962,9977,825,589,000196,838,0002,281,472