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:20Ian MckibbenIan MckibbenScore: 21,607,992Success
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:2021,455,0147,971,306,4847,737,498,000200,857,0002,281,472
2Jan 16, 2025 23:2021,505,0517,988,708,2267,759,022,000197,847,0002,301,952
3Jan 16, 2025 23:2021,505,3597,996,627,0977,756,135,000200,848,0002,396,160
4Jan 16, 2025 23:2021,531,6577,995,379,9887,765,872,000200,841,0002,412,544
5Jan 16, 2025 23:2021,607,9928,031,231,5167,800,105,000194,852,0002,277,376
6Jan 16, 2025 23:2021,610,6308,028,731,0057,803,080,000192,853,0002,281,472
7Jan 16, 2025 23:2021,632,5958,038,410,0567,804,209,000199,851,0002,301,952
8Jan 16, 2025 23:2021,642,5928,039,584,3107,807,915,000199,844,0002,416,640
9Jan 16, 2025 23:2021,654,7818,046,310,2837,827,425,000184,844,0002,285,568