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 21:24IlyaIlyaScore: 60,405Success
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 21:2660,04031,698,95221,109,0001,106,0002,113,536
2Jun 30, 2026 21:2660,18131,739,32721,188,0001,079,0002,113,536
3Jun 30, 2026 21:2660,30231,754,67121,193,0001,119,0002,113,536
4Jun 30, 2026 21:2660,32931,841,47021,212,0001,110,0002,113,536
5Jun 30, 2026 21:2660,40531,775,46121,212,0001,138,0002,113,536
6Jun 30, 2026 21:2660,44031,951,73421,155,0001,208,0002,113,536
7Jun 30, 2026 21:2660,44331,850,55121,193,0001,171,0002,113,536
8Jun 30, 2026 21:2660,59732,336,88121,225,0001,196,0002,113,536
9Jun 30, 2026 21:2660,63532,466,36921,230,0001,205,0002,113,536