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 13:25IlyaIlyaScore: 61,556Success
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 13:2861,28332,186,10521,567,0001,108,0002,113,536
2Jun 29, 2026 13:2861,31632,247,44821,580,0001,107,0002,113,536
3Jun 29, 2026 13:2861,42733,157,73521,613,0001,115,0002,113,536
4Jun 29, 2026 13:2861,51832,268,63121,645,0001,117,0002,113,536
5Jun 29, 2026 13:2861,55632,763,13721,672,0001,104,0002,113,536
6Jun 29, 2026 13:2861,66732,720,33921,606,0001,211,0002,113,536
7Jun 29, 2026 13:2861,87532,392,94221,678,0001,216,0002,113,536
8Jun 29, 2026 13:2861,87832,414,20621,656,0001,239,0002,113,536
9Jun 29, 2026 13:2861,94532,918,78921,719,0001,201,0002,113,536