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 7, 2026 13:53IlyaIlyaScore: 59,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 13:5458,92131,434,21520,692,0001,109,0002,113,536
2Jul 7, 2026 13:5458,98131,438,52420,692,0001,131,0002,113,536
3Jul 7, 2026 13:5459,12732,100,90620,689,0001,188,0002,113,536
4Jul 7, 2026 13:5459,14331,551,11320,701,0001,182,0002,113,536
5Jul 7, 2026 13:5459,18331,691,26220,696,0001,202,0002,113,536
6Jul 7, 2026 13:5459,18931,520,83420,770,0001,130,0002,113,536
7Jul 7, 2026 13:5459,30831,667,98920,699,0001,245,0002,113,536
8Jul 7, 2026 13:5459,45432,279,36020,767,0001,231,0002,113,536
9Jul 7, 2026 13:5459,57832,384,61820,773,0001,271,0002,113,536