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 19:30Dominique GarmierDominique GarmierScore: 70,495Success
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 19:3070,48656,132,58525,077,0001,003,0002,281,472
2Mar 24, 2026 19:3070,49555,146,65024,077,0002,006,0002,281,472
3Mar 24, 2026 19:3070,75454,315,64924,166,0002,013,0002,392,064