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 04:30Dominique GarmierDominique GarmierScore: 69,984Success
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 04:3069,94153,979,19924,883,000995,0002,392,064
2Mar 21, 2026 04:3069,98448,311,83824,899,000995,0002,273,280
3Mar 21, 2026 04:3070,31450,329,70924,015,0002,001,0002,519,040