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 22:32IlyaIlyaScore: 59,208Success
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 22:3358,89131,477,38320,690,0001,100,0002,113,536
2Jun 30, 2026 22:3359,05131,319,81720,718,0001,131,0002,113,536
3Jun 30, 2026 22:3359,14831,715,79920,676,0001,209,0002,113,536
4Jun 30, 2026 22:3359,20231,333,54920,777,0001,128,0002,113,536
5Jun 30, 2026 22:3359,20831,497,34220,769,0001,138,0002,113,536
6Jun 30, 2026 22:3359,21831,756,60420,815,0001,096,0002,113,536
7Jun 30, 2026 22:3359,35131,439,56120,783,0001,177,0002,113,536
8Jun 30, 2026 22:3321,640,5598,016,949,8937,855,198,000151,809,0002,113,536
9Jun 30, 2026 22:3321,672,9568,028,774,3767,862,681,000156,313,0002,113,536