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:03IlyaIlyaScore: 58,754Success
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:0458,32431,219,60520,476,0001,104,0002,113,536
2Jul 8, 2026 22:0458,68931,419,62320,480,0001,235,0002,113,536
3Jul 8, 2026 22:0458,72931,395,15720,535,0001,195,0002,113,536
4Jul 8, 2026 22:0458,75131,491,60720,510,0001,228,0002,113,536
5Jul 8, 2026 22:0458,75431,383,21120,547,0001,192,0002,113,536
6Jul 8, 2026 22:0458,89732,014,53120,604,0001,188,0002,113,536
7Jul 8, 2026 22:0458,93732,111,33320,588,0001,219,0002,113,536
8Jul 8, 2026 22:0421,407,0107,930,481,3607,771,515,000149,079,0002,113,536
9Jul 8, 2026 22:0421,599,6488,002,113,3797,839,876,000151,994,0002,113,536