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: 3,782,216Success
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:233,781,1681,424,070,7921,397,034,0001,998,0002,289,664
2Jan 16, 2025 23:233,781,6221,423,325,5581,397,202,0001,998,0002,363,392
3Jan 16, 2025 23:233,781,6431,427,189,2211,398,209,000999,0002,289,664
4Jan 16, 2025 23:233,781,9411,422,522,9461,399,318,00002,269,184
5Jan 16, 2025 23:233,782,2161,420,556,2981,398,421,000999,0002,289,664
6Jan 16, 2025 23:233,782,2651,424,924,8601,398,439,000999,0002,265,088
7Jan 16, 2025 23:233,782,5221,431,639,3821,397,534,0001,999,0002,289,664
8Jan 16, 2025 23:233,782,5651,423,000,4661,398,550,000999,0002,379,776
9Jan 16, 2025 23:233,782,9541,431,490,9691,397,695,0001,998,0002,289,664