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:25izotoffizotoffScore: 117,789Success
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:25117,16568,487,39740,327,0003,024,0002,347,008
2Mar 21, 2026 16:25117,78975,761,07341,555,0002,027,0002,408,448
3Mar 21, 2026 16:25118,93072,809,25741,004,0003,000,0002,408,448