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 2, 2026 12:32IlyaIlyaScore: 59,202Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 12:3358,69131,156,31120,612,0001,104,0002,113,536
2Jul 2, 2026 12:3358,84831,226,46420,668,0001,106,0002,113,536
3Jul 2, 2026 12:3358,92131,437,88520,630,0001,171,0002,113,536
4Jul 2, 2026 12:3358,95931,331,73620,625,0001,190,0002,113,536
5Jul 2, 2026 12:3359,20231,886,97320,692,0001,213,0002,113,536
6Jul 2, 2026 12:3359,21631,449,76920,706,0001,204,0002,113,536
7Jul 2, 2026 12:3359,27231,889,88220,719,0001,212,0002,113,536
8Jul 2, 2026 12:3359,30531,898,34020,729,0001,214,0002,113,536
9Jul 2, 2026 12:3359,35631,889,98820,750,0001,212,0002,113,536