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:30IlyaIlyaError
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:31030,023,58418,909,0001,214,0002,113,536expected "429496509645 ", got "429496470253 "
2Jun 29, 2026 20:31029,943,11718,884,0001,191,0002,113,536expected "429496472169 ", got "429496420268 "
3Jun 29, 2026 20:31029,539,18818,949,0001,123,0002,113,536expected "429496524609 ", got "429496504489 "