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 3, 2026 08:00IlyaIlyaScore: 59,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 08:0258,65931,230,79520,613,0001,091,0002,113,536
2Jul 3, 2026 08:0258,91031,337,33520,653,0001,144,0002,113,536
3Jul 3, 2026 08:0258,92931,333,56120,685,0001,119,0002,113,536
4Jul 3, 2026 08:0259,03531,418,92220,625,0001,218,0002,113,536
5Jul 3, 2026 08:0259,04031,348,66720,674,0001,171,0002,113,536
6Jul 3, 2026 08:0259,14531,405,27720,701,0001,183,0002,113,536
7Jul 3, 2026 08:0259,14831,872,04120,681,0001,204,0002,113,536
8Jul 3, 2026 08:0259,15431,416,67520,680,0001,207,0002,113,536
9Jul 3, 2026 08:0259,17831,430,74720,778,0001,118,0002,113,536