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 listJul 8, 2026 14:57IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 14:58031,310,94920,474,0001,126,0002,113,536expected "429496523121 ", got "429496361360 "
2Jul 8, 2026 14:58031,996,11520,470,0001,219,0002,113,536expected "429496564669 ", got "429496353095 "
3Jul 8, 2026 14:58031,948,10420,462,0001,195,0002,113,536expected "429496515437 ", got "429496341654 "