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 25, 2026 19:57Dominique GarmierDominique GarmierScore: 121,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 19:57120,03868,168,69843,405,0001,009,0002,473,984
2Mar 25, 2026 19:57121,34976,875,47942,904,0001,995,0002,277,376
3Mar 25, 2026 19:57121,39270,998,33442,919,0001,996,0002,486,272