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 listJul 8, 2026 17:32IlyaIlyaScore: 59,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 17:3459,40531,610,09020,878,0001,102,0002,113,536
2Jul 8, 2026 17:3459,42931,731,53620,843,0001,146,0002,113,536
3Jul 8, 2026 17:3459,54031,729,93220,910,0001,120,0002,113,536
4Jul 8, 2026 17:3459,55131,718,31220,938,0001,096,0002,113,536
5Jul 8, 2026 17:3459,58931,701,14720,939,0001,109,0002,113,536
6Jul 8, 2026 17:3459,61631,687,23620,925,0001,133,0002,113,536
7Jul 8, 2026 17:3459,64031,713,04120,884,0001,183,0002,113,536
8Jul 8, 2026 17:3459,78631,746,29920,978,0001,143,0002,113,536
9Jul 8, 2026 17:3459,97231,875,90621,120,0001,070,0002,113,536