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 listJul 3, 2026 08:07IlyaIlyaScore: 59,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 08:0859,07031,318,09720,734,0001,122,0002,113,536
2Jul 3, 2026 08:0859,09731,446,80020,758,0001,108,0002,113,536
3Jul 3, 2026 08:0859,22431,501,73520,800,0001,113,0002,113,536
4Jul 3, 2026 08:0859,24331,418,39920,805,0001,115,0002,113,536
5Jul 3, 2026 08:0859,29131,436,05420,812,0001,126,0002,113,536
6Jul 3, 2026 08:0859,39431,406,76620,854,0001,122,0002,113,536
7Jul 3, 2026 08:0859,50032,060,20820,822,0001,193,0002,113,536
8Jul 3, 2026 08:0859,61332,051,21920,836,0001,221,0002,113,536
9Jul 3, 2026 08:0859,62731,623,70020,846,0001,216,0002,113,536