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 21, 2026 12:27Dominique GarmierDominique GarmierScore: 69,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 12:2769,91154,031,56624,873,000994,0002,273,280
2Mar 21, 2026 12:2769,93250,251,00524,880,000995,0002,400,256
3Mar 21, 2026 12:2770,18451,003,84623,971,0001,997,0002,387,968