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 21:16IlyaIlyaScore: 60,918Success
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 21:2160,49131,949,70921,275,0001,107,0002,113,536
2Jun 29, 2026 21:2160,59131,891,58021,331,0001,088,0002,113,536
3Jun 29, 2026 21:2160,62731,932,33921,246,0001,186,0002,113,536
4Jun 29, 2026 21:2160,77832,415,60721,305,0001,183,0002,113,536
5Jun 29, 2026 21:2160,91832,485,26521,348,0001,192,0002,113,536
6Jun 29, 2026 21:2160,96232,523,10921,338,0001,218,0002,113,536
7Jun 29, 2026 21:2161,11032,516,18521,406,0001,205,0002,113,536
8Jun 29, 2026 21:2161,11332,121,59021,393,0001,219,0002,113,536
9Jun 29, 2026 21:2161,11632,580,66421,379,0001,234,0002,113,536