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 20:49IlyaIlyaScore: 62,321Success
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 20:5162,11032,590,46021,865,0001,116,0002,113,536
2Jul 8, 2026 20:5162,15432,628,44021,890,0001,107,0002,113,536
3Jul 8, 2026 20:5162,15432,671,60021,854,0001,143,0002,113,536
4Jul 8, 2026 20:5162,19732,672,19521,887,0001,126,0002,113,536
5Jul 8, 2026 20:5162,32132,699,10821,886,0001,173,0002,113,536
6Jul 8, 2026 20:5162,35132,748,89921,876,0001,194,0002,113,536
7Jul 8, 2026 20:5162,40532,719,47021,981,0001,109,0002,113,536
8Jul 8, 2026 20:5162,71333,459,05422,000,0001,204,0002,113,536
9Jul 8, 2026 20:5163,14033,179,28822,169,0001,193,0002,113,536