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 listMar 20, 2026 17:34olliecrowolliecrowScore: 102,219Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 17:34101,45164,077,19337,537,00002,330,624
2Mar 20, 2026 17:34102,21965,723,72535,831,0001,990,0002,334,720
3Mar 20, 2026 17:34103,41163,882,51535,242,0003,020,0002,449,408