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 listAug 14, 2026 21:51Tomislav TunkovicTomislav TunkovicScore: 62,924Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 21:5162,90831,702,36022,160,0001,116,0002,121,728stderr
2Aug 14, 2026 21:5162,92431,647,95322,154,0001,128,0002,121,728stderr
3Aug 14, 2026 21:5163,39431,683,50322,307,0001,149,0002,121,728stderr