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 9, 2026 12:52IlyaIlyaScore: 58,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 12:5358,47831,322,14220,536,0001,101,0002,113,536
2Jul 9, 2026 12:5358,48931,246,36420,515,0001,126,0002,113,536
3Jul 9, 2026 12:5358,58331,258,07820,492,0001,184,0002,113,536
4Jul 9, 2026 12:5358,70532,741,17320,588,0001,133,0002,113,536
5Jul 9, 2026 12:5358,80031,405,96620,554,0001,202,0002,113,536
6Jul 9, 2026 12:5358,89732,079,14020,593,0001,199,0002,113,536
7Jul 9, 2026 12:5359,02732,284,75220,625,0001,215,0002,113,536
8Jul 9, 2026 12:5321,640,1868,016,758,6627,857,692,000149,177,0002,113,536
9Jul 9, 2026 12:5321,656,8328,022,868,5297,861,539,000151,489,0002,113,536