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:18IlyaIlyaScore: 59,151Success
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:2258,97831,802,04020,619,0001,203,0002,113,536
2Jun 29, 2026 21:2259,06731,348,80720,664,0001,191,0002,113,536
3Jun 29, 2026 21:2259,07031,828,25720,657,0001,199,0002,113,536
4Jun 29, 2026 21:2259,10231,336,30720,669,0001,199,0002,117,632
5Jun 29, 2026 21:2259,15132,668,87020,737,0001,149,0002,113,536
6Jun 29, 2026 21:2259,15631,844,81620,664,0001,224,0002,113,536
7Jun 29, 2026 21:2259,20831,921,63220,702,0001,205,0002,113,536
8Jun 29, 2026 21:2259,23231,849,89020,683,0001,233,0002,113,536
9Jun 29, 2026 21:2259,32931,881,44120,734,0001,218,0002,113,536