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 26, 2026 06:56IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 06:57022,445,42312,088,0001,215,0002,113,536expected "429496533823 ", got "429496501570 "
2Jun 26, 2026 06:57023,533,04812,038,0001,227,0002,113,536expected "429496485467 ", got "429496458942 "
3Jun 26, 2026 06:57023,051,92712,065,0001,223,0002,113,536expected "429496505117 ", got "429496503325 "