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 16:21izotoffizotoffScore: 117,495Success
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 16:21117,39569,452,61141,416,0002,020,0002,420,736
2Mar 21, 2026 16:21117,49565,617,24143,473,00002,478,080
3Mar 21, 2026 16:21118,48674,380,24141,848,0001,992,0002,334,720