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 25, 2026 22:26IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 22:26032,736,24322,344,0001,207,0002,113,536expected "429496533776 ", got "429496530518 "
2Jun 25, 2026 22:2663,31033,139,58122,198,0001,227,0002,113,536
3Jun 25, 2026 22:2663,31832,777,70522,235,0001,193,0002,113,536