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 12, 2026 22:01IlyaIlyaScore: 58,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 22:0258,22131,138,44620,437,0001,105,0002,113,536
2Jul 12, 2026 22:0258,24531,208,39920,434,0001,117,0002,113,536
3Jul 12, 2026 22:0258,34831,250,43720,453,0001,136,0002,113,536
4Jul 12, 2026 22:0258,41331,229,35520,517,0001,096,0002,113,536
5Jul 12, 2026 22:0258,41331,315,15420,500,0001,113,0002,113,536
6Jul 12, 2026 22:0258,53731,369,88220,502,0001,157,0002,113,536
7Jul 12, 2026 22:0258,58631,268,19820,533,0001,144,0002,113,536
8Jul 12, 2026 22:0258,60032,697,54020,493,0001,189,0002,113,536
9Jul 12, 2026 22:0258,60031,335,12920,476,0001,206,0002,113,536