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 listOct 20, 2026 00:43e1011e1011Score: 136,018Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 00:44134,65161,213,26448,633,0001,188,0002,113,536
2Oct 20, 2026 00:44135,04860,889,68748,873,0001,095,0002,113,536
3Oct 20, 2026 00:44135,33761,029,17448,885,0001,190,0002,113,536
4Oct 20, 2026 00:44135,98961,671,21049,110,0001,206,0002,113,536
5Oct 20, 2026 00:44136,01861,809,36149,118,0001,209,0002,113,536
6Oct 20, 2026 00:44137,32961,782,14449,632,0001,180,0002,113,536
7Oct 20, 2026 00:44138,92162,285,70550,296,0001,105,0002,113,536
8Oct 20, 2026 00:44139,25962,611,68450,319,0001,207,0002,113,536
9Oct 20, 2026 00:44140,61663,515,68450,844,0001,184,0002,113,536