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 30, 2026 17:38IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 17:40044,429,48729,209,0005,210,0002,113,536expected "429496532206 ", got "25406000000001 "
2Jun 30, 2026 17:40043,806,12529,070,0005,184,0002,113,536expected "429496544743 ", got "25412000000001 "
3Jun 30, 2026 17:40043,905,30629,205,0005,209,0002,113,536expected "429496462525 ", got "25540000000001 "