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:13IlyaIlyaScore: 59,178Success
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:1458,96731,269,71420,711,0001,107,0002,113,536
2Jun 30, 2026 21:1458,97831,245,58720,720,0001,102,0002,113,536
3Jun 30, 2026 21:1459,02132,578,05420,650,0001,188,0002,113,536
4Jun 30, 2026 21:1459,09731,747,08920,716,0001,150,0002,113,536
5Jun 30, 2026 21:1459,17831,899,74920,690,0001,206,0002,113,536
6Jun 30, 2026 21:1459,43231,964,15120,790,0001,200,0002,113,536
7Jun 30, 2026 21:1459,43231,874,00920,789,0001,201,0002,113,536
8Jun 30, 2026 21:1459,49432,005,25520,755,0001,258,0002,113,536
9Jun 30, 2026 21:1459,52131,483,51120,984,0001,039,0002,113,536