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 13:49IlyaIlyaScore: 60,764Success
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 13:5060,53531,892,72721,280,0001,118,0002,113,536
2Jun 29, 2026 13:5060,58631,881,95121,300,0001,117,0002,113,536
3Jun 29, 2026 13:5060,60031,912,45021,313,0001,109,0002,113,536
4Jun 29, 2026 13:5060,72731,968,49521,328,0001,141,0002,113,536
5Jun 29, 2026 13:5060,76431,965,29021,369,0001,114,0002,113,536
6Jun 29, 2026 13:5060,78131,964,47421,378,0001,111,0002,113,536
7Jun 29, 2026 13:5060,82932,473,43321,291,0001,216,0002,113,536
8Jun 29, 2026 13:5060,97832,511,42821,311,0001,251,0002,113,536
9Jun 29, 2026 13:5061,20032,505,29521,428,0001,216,0002,113,536