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 12, 2026 03:00olliecrowolliecrowScore: 60,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 03:0060,53549,285,99621,380,0001,018,0002,273,280
2Mar 12, 2026 03:0060,92244,600,88521,517,0001,024,0002,404,352
3Mar 12, 2026 03:0060,93050,541,98522,544,00002,273,280