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 listJan 16, 2025 23:23Ian MckibbenIan MckibbenScore: 21,231,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2025 23:2321,098,8247,841,648,8297,618,720,000187,845,0002,281,472
2Jan 16, 2025 23:2321,121,7437,844,265,5617,625,214,000189,831,0002,281,472
3Jan 16, 2025 23:2321,143,6767,851,903,4407,632,327,000190,833,0002,281,472
4Jan 16, 2025 23:2321,215,7687,882,147,2377,656,986,000192,848,0002,306,048
5Jan 16, 2025 23:2321,231,7707,882,129,3337,663,932,000191,823,0002,314,240
6Jan 16, 2025 23:2321,253,0057,896,317,0767,663,775,000199,837,0002,314,240
7Jan 16, 2025 23:2321,270,5087,906,823,5347,673,261,000196,827,0002,281,472
8Jan 16, 2025 23:2321,285,6657,908,643,6537,677,855,000197,841,0002,281,472
9Jan 16, 2025 23:2321,316,2437,927,923,7717,697,179,000189,831,0002,310,144