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 8, 2026 23:18IlyaIlyaScore: 58,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 23:2058,20831,208,58520,440,0001,097,0002,113,536
2Jul 8, 2026 23:2058,34331,237,88320,477,0001,110,0002,113,536
3Jul 8, 2026 23:2058,38331,341,41720,408,0001,194,0002,113,536
4Jul 8, 2026 23:2058,60531,991,04920,486,0001,198,0002,113,536
5Jul 8, 2026 23:2058,67831,978,80520,481,0001,230,0002,113,536
6Jul 8, 2026 23:2060,56442,379,16021,257,0001,152,0002,113,536
7Jul 8, 2026 23:2021,585,5627,997,247,5757,835,215,000151,443,0002,113,536
8Jul 8, 2026 23:2021,591,2897,998,804,8437,839,054,000149,723,0002,113,536
9Jul 8, 2026 23:2021,660,8728,024,372,3307,860,825,000153,698,0002,113,536