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:23IlyaIlyaScore: 60,232Success
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:2860,08331,665,85721,048,0001,183,0002,113,536
2Jun 29, 2026 21:2860,08631,653,17721,134,0001,098,0002,113,536
3Jun 29, 2026 21:2860,08631,719,95121,100,0001,132,0002,113,536
4Jun 29, 2026 21:2860,10831,752,02721,053,0001,187,0002,113,536
5Jun 29, 2026 21:2860,23232,220,72721,093,0001,193,0002,113,536
6Jun 29, 2026 21:2860,29132,208,86721,096,0001,212,0002,113,536
7Jun 29, 2026 21:2860,31631,873,03021,128,0001,189,0002,113,536
8Jun 29, 2026 21:2860,32432,274,33621,112,0001,208,0002,113,536
9Jun 29, 2026 21:2860,45632,278,01221,165,0001,204,0002,113,536