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 24, 2026 05:01Dominique GarmierDominique GarmierScore: 442,376Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 05:01440,276190,390,785160,904,0001,998,0002,535,424
2Mar 24, 2026 05:01442,376190,513,046162,681,000998,0002,351,104
3Mar 24, 2026 05:01442,822192,091,838161,846,0001,998,0002,277,376