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 22:00IlyaIlyaScore: 58,664Success
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 22:0258,41831,396,32820,510,0001,105,0002,113,536
2Jul 8, 2026 22:0258,43231,218,25420,510,0001,110,0002,113,536
3Jul 8, 2026 22:0258,55131,342,65420,564,0001,100,0002,113,536
4Jul 8, 2026 22:0258,55431,295,98220,565,0001,100,0002,113,536
5Jul 8, 2026 22:0258,66431,365,94320,496,0001,210,0002,113,536
6Jul 8, 2026 22:0258,67031,383,91420,573,0001,135,0002,113,536
7Jul 8, 2026 22:0221,493,9437,962,969,7327,802,857,000149,902,0002,113,536
8Jul 8, 2026 22:0221,496,2867,963,520,8597,806,447,000147,179,0002,113,536
9Jul 8, 2026 22:0221,630,7628,013,171,2557,855,786,000147,596,0002,113,536