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 30, 2026 08:07IlyaIlyaScore: 61,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 08:0961,35132,171,32921,603,0001,097,0002,113,536
2Jun 30, 2026 08:0961,52932,260,18621,661,0001,105,0002,113,536
3Jun 30, 2026 08:0961,60232,277,48421,675,0001,118,0002,113,536
4Jun 30, 2026 08:0961,69732,320,40421,637,0001,191,0002,113,536
5Jun 30, 2026 08:0961,77032,410,20121,753,0001,102,0002,113,536
6Jun 30, 2026 08:0961,87032,877,59621,679,0001,213,0002,113,536
7Jun 30, 2026 08:0961,87532,388,51821,774,0001,120,0002,113,536
8Jun 30, 2026 08:0961,94832,821,93821,715,0001,206,0002,113,536
9Jun 30, 2026 08:0962,27533,031,41421,805,0001,237,0002,113,536