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 20:56IlyaIlyaScore: 60,654Success
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 20:5760,56431,884,26921,298,0001,111,0002,113,536
2Jun 29, 2026 20:5760,59731,914,67521,307,0001,114,0002,113,536
3Jun 29, 2026 20:5760,63731,838,19721,334,0001,102,0002,113,536
4Jun 29, 2026 20:5760,64332,408,34521,322,0001,116,0002,113,536
5Jun 29, 2026 20:5760,65431,926,41621,338,0001,104,0002,113,536
6Jun 29, 2026 20:5760,68933,225,08221,328,0001,127,0002,113,536
7Jun 29, 2026 20:5760,91632,027,55121,388,0001,151,0002,113,536
8Jun 29, 2026 20:5761,07032,036,01421,387,0001,209,0002,113,536
9Jun 29, 2026 20:5761,17832,400,54921,397,0001,239,0002,113,536