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 22, 2026 11:47Dominique GarmierDominique GarmierScore: 96,835Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 11:4795,69761,543,46433,385,0002,023,0002,363,392
2Mar 22, 2026 11:4796,83559,402,99833,839,0001,990,0002,289,664
3Mar 22, 2026 11:4798,77865,650,39235,533,0001,015,0002,351,104