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:15IlyaIlyaScore: 60,351Success
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:1660,10231,686,54021,048,0001,190,0002,113,536
2Jul 2, 2026 12:1660,16732,099,30221,080,0001,182,0002,113,536
3Jul 2, 2026 12:1660,20032,260,57221,061,0001,213,0002,113,536
4Jul 2, 2026 12:1660,24532,301,47021,098,0001,193,0002,113,536
5Jul 2, 2026 12:1660,35132,315,27121,131,0001,199,0002,113,536
6Jul 2, 2026 12:1660,35632,315,15421,130,0001,202,0002,113,536
7Jul 2, 2026 12:1660,37232,319,84621,097,0001,241,0002,113,536
8Jul 2, 2026 12:1660,45632,419,69621,175,0001,194,0002,113,536
9Jul 2, 2026 12:1660,51332,410,05421,180,0001,210,0002,113,536