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 19, 2026 00:06Dominique GarmierDominique GarmierScore: 69,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 00:0669,90551,697,41323,876,0001,989,0002,400,256
2Mar 19, 2026 00:0669,93852,192,32625,877,00002,273,280
3Mar 19, 2026 00:0670,33056,302,87525,022,0001,000,0002,273,280