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 listJun 30, 2026 14:27IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 14:28038,099,09927,461,0001,132,0002,113,536expected "429496546254 ", got "429496542623 "
2Jun 30, 2026 14:28038,082,20127,499,0001,100,0002,113,536expected "429496587124 ", got "429496583930 "
3Jun 30, 2026 14:2876,75137,853,07927,295,0001,103,0002,113,536
4Jun 30, 2026 14:2877,06737,998,17427,398,0001,117,0002,113,536
5Jun 30, 2026 14:2877,38638,084,30327,531,0001,102,0002,113,536
6Jun 30, 2026 14:2877,43738,201,79227,460,0001,192,0002,113,536
7Jun 30, 2026 14:2877,73238,272,23727,617,0001,144,0002,113,536
8Jun 30, 2026 14:2877,81838,724,14727,581,0001,212,0002,113,536
9Jun 30, 2026 14:2877,89138,706,38527,611,0001,209,0002,113,536