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 13, 2026 15:03Dominique GarmierDominique GarmierScore: 525,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 15:03524,776221,504,682193,167,0001,000,0002,457,600
2Mar 13, 2026 15:03525,803226,395,897192,552,0001,995,0002,453,504
3Mar 13, 2026 15:03525,965223,880,209193,604,0001,003,0002,293,760