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 20, 2026 20:11A_ShamanA_ShamanScore: 1,325,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 20:121,285,445484,681,726288,992,000186,623,0002,117,632
2Jun 20, 2026 20:121,303,597491,429,666299,688,000182,643,0002,117,632
3Jun 20, 2026 20:121,315,297495,788,555303,543,000183,117,0002,117,632
4Jun 20, 2026 20:121,317,994496,711,433301,334,000186,324,0002,117,632
5Jun 20, 2026 20:121,325,586499,541,935304,407,000186,060,0002,117,632
6Jun 20, 2026 20:121,336,627503,582,310311,783,000182,769,0002,117,632
7Jun 20, 2026 20:121,341,300505,336,436310,969,000185,312,0002,117,632
8Jun 20, 2026 20:121,344,124506,417,305310,800,000186,526,0002,117,632
9Jun 20, 2026 20:121,357,337511,298,976316,124,000186,091,0002,117,632