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 29, 2026 21:31IlyaIlyaScore: 59,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 21:3258,93731,286,46020,685,0001,122,0002,113,536
2Jun 29, 2026 21:3259,05631,245,48020,736,0001,115,0002,113,536
3Jun 29, 2026 21:3259,06731,314,89120,759,0001,096,0002,113,536
4Jun 29, 2026 21:3259,10232,728,35220,685,0001,183,0002,113,536
5Jun 29, 2026 21:3259,27231,881,80120,736,0001,195,0002,113,536
6Jun 29, 2026 21:3259,30231,869,78320,762,0001,180,0002,113,536
7Jun 29, 2026 21:3259,34331,429,93120,770,0001,187,0002,113,536
8Jun 29, 2026 21:3259,38331,398,18320,948,0001,024,0002,113,536
9Jun 29, 2026 21:3259,41031,878,68920,765,0001,217,0002,113,536