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:41IlyaIlyaError
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:42031,461,35520,892,0001,148,0002,113,536expected "429496515593 ", got "429496492876 "
2Jun 29, 2026 20:42031,922,28820,977,0001,111,0002,113,536expected "429496520161 ", got "429496504496 "
3Jun 29, 2026 20:42031,503,56820,861,0001,182,0002,113,536expected "429496470496 ", got "429496436501 "