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 24, 2026 08:32Dominique GarmierDominique GarmierScore: 199,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 08:32199,57696,889,28372,846,000997,0002,543,616
2Mar 24, 2026 08:32199,586102,718,15271,852,0001,995,0002,289,664
3Mar 24, 2026 08:32199,754104,973,58271,912,0001,997,0002,543,616