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 22:30IlyaIlyaScore: 64,213Success
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 22:3262,51332,382,87322,008,0001,122,0002,113,536
2Jun 25, 2026 22:3262,55632,394,76822,027,0001,119,0002,113,536
3Jun 25, 2026 22:3262,74332,501,51122,104,0001,111,0002,113,536
4Jun 25, 2026 22:3263,03532,638,20922,123,0001,200,0002,113,536
5Jun 25, 2026 22:3264,21333,021,72822,621,0001,138,0002,113,536
6Jun 25, 2026 22:3264,53733,657,68222,652,0001,227,0002,113,536
7Jun 25, 2026 22:3264,68933,663,02222,709,0001,226,0002,113,536
8Jun 25, 2026 22:3265,30233,932,12023,114,0001,048,0002,113,536
9Jun 25, 2026 22:3265,40839,455,71223,157,0001,044,0002,113,536