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 26, 2026 19:12Dominique GarmierDominique GarmierScore: 81,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 19:1281,15754,318,64428,027,0002,001,0002,396,160
2Mar 26, 2026 19:1281,29252,189,18228,073,0002,005,0002,506,752
3Mar 26, 2026 19:1281,55753,946,65329,171,0001,005,0002,387,968