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 25, 2026 18:34IlyaIlyaScore: 77,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 18:3571,28336,090,42425,152,0001,223,0002,113,536
2Jun 25, 2026 18:3571,71336,268,72725,314,0001,220,0002,113,536
3Jun 25, 2026 18:3577,29737,979,62927,488,0001,112,0002,113,536
4Jun 25, 2026 18:3577,74038,432,44427,546,0001,218,0002,113,536
5Jun 25, 2026 18:3577,77538,068,95027,624,0001,153,0002,113,536
6Jun 25, 2026 18:3577,81638,066,10127,590,0001,202,0002,113,536
7Jun 25, 2026 18:3577,94838,621,87727,624,0001,217,0002,113,536
8Jun 25, 2026 18:3578,32938,728,62227,758,0001,224,0002,113,536
9Jun 25, 2026 18:3578,39738,310,98427,981,0001,026,0002,113,536