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 12:27Dominique GarmierDominique GarmierScore: 72,557Success
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 12:2772,53858,113,47825,845,000994,0002,514,944
2Mar 21, 2026 12:2772,55755,777,70425,852,000994,0002,289,664
3Mar 21, 2026 12:2773,06254,553,68025,031,0002,002,0002,527,232