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:35IlyaIlyaScore: 58,900Success
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:3658,66232,386,94620,606,0001,099,0002,113,536
2Jun 30, 2026 22:3658,82131,179,20520,651,0001,113,0002,113,536
3Jun 30, 2026 22:3658,88131,408,61420,694,0001,092,0002,113,536
4Jun 30, 2026 22:3658,88931,578,45120,660,0001,129,0002,113,536
5Jun 30, 2026 22:3658,90031,221,25120,682,0001,111,0002,113,536
6Jun 30, 2026 22:3658,92431,242,84220,701,0001,101,0002,113,536
7Jun 30, 2026 22:3659,03231,421,91020,685,0001,157,0002,113,536
8Jun 30, 2026 22:3659,11831,382,09820,694,0001,180,0002,113,536
9Jun 30, 2026 22:3659,15131,402,73920,771,0001,115,0002,113,536