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 listJun 30, 2026 16:40IlyaIlyaScore: 60,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 16:4458,92931,748,80820,562,0001,242,0002,113,536
2Jun 30, 2026 16:4459,14831,506,10420,677,0001,208,0002,113,536
3Jun 30, 2026 16:4459,19431,861,87520,676,0001,226,0002,113,536
4Jun 30, 2026 16:4459,30531,935,07520,726,0001,217,0002,113,536
5Jun 30, 2026 16:4460,17032,134,99021,063,0001,200,0002,113,536
6Jun 30, 2026 16:4421,110,8727,820,692,2257,653,516,000157,507,0002,113,536
7Jun 30, 2026 16:4421,160,3727,839,432,4387,671,019,000158,319,0002,113,536
8Jun 30, 2026 16:4421,192,0567,851,070,6757,685,921,000155,140,0002,113,536
9Jun 30, 2026 16:4421,197,1917,853,029,5477,687,469,000155,492,0002,113,536