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 listJun 29, 2026 21:23IlyaIlyaScore: 60,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 21:2459,85431,609,24421,056,0001,090,0002,113,536
2Jun 29, 2026 21:2460,11631,668,08521,150,0001,093,0002,113,536
3Jun 29, 2026 21:2460,15931,942,37521,072,0001,187,0002,113,536
4Jun 29, 2026 21:2460,32932,298,76021,116,0001,206,0002,113,536
5Jun 29, 2026 21:2460,32931,842,80021,109,0001,213,0002,113,536
6Jun 29, 2026 21:2460,40032,172,33021,164,0001,184,0002,113,536
7Jun 29, 2026 21:2460,41832,276,94721,144,0001,211,0002,113,536
8Jun 29, 2026 21:2460,52432,365,80121,190,0001,204,0002,113,536
9Jun 29, 2026 21:2462,31842,197,98021,892,0001,166,0002,113,536