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 20:30Dominique GarmierDominique GarmierScore: 70,473Success
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 21:0570,29250,380,78324,008,0002,000,0002,277,376
2Mar 25, 2026 20:3070,30042,221,29124,011,0002,000,0002,277,376
3Mar 25, 2026 21:0570,44154,463,86024,059,0002,004,0002,277,376
4Mar 25, 2026 21:0570,47348,367,54824,070,0002,005,0002,277,376
5Mar 25, 2026 20:3070,66252,800,89324,134,0002,011,0002,478,080
6Mar 25, 2026 20:3070,79251,213,32624,179,0002,014,0002,277,376