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 24, 2026 23:16IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 23:1608,285,158,9718,109,193,000165,976,0002,113,536expected "429496496571 ", got "0 "
2Jun 24, 2026 23:1608,312,030,5688,134,029,000167,164,0002,113,536expected "429496506521 ", got "0 "
3Jun 24, 2026 23:1608,271,259,9798,087,947,000172,854,0002,113,536expected "429496464647 ", got "0 "