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 16, 2026 22:31izotoffizotoffScore: 124,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 16, 2026 22:31123,95974,890,61443,871,0001,994,0002,396,160
2Mar 16, 2026 22:31124,78973,735,71043,161,0003,011,0002,392,064
3Mar 16, 2026 22:31125,05775,085,20644,260,0002,011,0002,314,240