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 15, 2026 23:14Dominique GarmierDominique GarmierScore: 72,649Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 23:1472,04151,536,89925,630,0001,025,0002,269,184
2Mar 15, 2026 23:1472,64956,180,82024,889,0001,991,0002,289,664
3Mar 15, 2026 23:1472,66854,162,55225,892,000995,0002,289,664