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 13:52IlyaIlyaScore: 60,070Success
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 13:5359,71831,609,73921,004,0001,092,0002,113,536
2Jun 30, 2026 13:5359,84331,566,51921,020,0001,122,0002,113,536
3Jun 30, 2026 13:5359,87031,684,53221,011,0001,141,0002,113,536
4Jun 30, 2026 13:5360,03732,069,84921,082,0001,132,0002,113,536
5Jun 30, 2026 13:5360,07031,655,35921,106,0001,120,0002,113,536
6Jun 30, 2026 13:5360,21331,845,35221,078,0001,201,0002,113,536
7Jun 30, 2026 13:5360,26432,204,44321,046,0001,252,0002,113,536
8Jun 30, 2026 13:5360,29132,262,89921,088,0001,220,0002,113,536
9Jun 30, 2026 13:5360,36232,278,34721,113,0001,221,0002,113,536