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 15, 2026 22:45Dominique GarmierDominique GarmierScore: 70,014Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 22:4569,91148,369,05623,878,0001,989,0002,383,872
2Mar 15, 2026 22:4570,01450,912,52523,913,0001,992,0002,396,160
3Mar 15, 2026 22:4570,21953,620,06623,983,0001,998,0002,273,280