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 01:19Dominique GarmierDominique GarmierScore: 154,186Success
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 01:19154,15184,113,45856,036,0001,000,0002,531,328
2Mar 24, 2026 01:19154,18682,750,28356,049,0001,000,0002,297,856
3Mar 24, 2026 01:19155,04982,759,19256,362,0001,006,0002,334,720