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 08:02IlyaIlyaScore: 61,781Success
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 08:0561,54532,272,95621,653,0001,119,0002,113,536
2Jun 30, 2026 08:0561,65132,289,59121,721,0001,090,0002,113,536
3Jun 30, 2026 08:0561,67532,333,13121,674,0001,146,0002,113,536
4Jun 30, 2026 08:0561,77532,409,45621,685,0001,172,0002,113,536
5Jun 30, 2026 08:0561,78132,744,89521,659,0001,200,0002,113,536
6Jun 30, 2026 08:0561,80032,390,94221,749,0001,117,0002,113,536
7Jun 30, 2026 08:0561,80832,890,73721,655,0001,214,0002,113,536
8Jun 30, 2026 08:0561,82732,361,92521,759,0001,117,0002,113,536
9Jun 30, 2026 08:0561,88932,384,72721,760,0001,139,0002,113,536