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 8, 2026 21:54IlyaIlyaScore: 58,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 21:5658,38631,268,92820,498,0001,105,0002,113,536
2Jul 8, 2026 21:5658,55631,379,41420,540,0001,126,0002,113,536
3Jul 8, 2026 21:5658,58131,301,18420,547,0001,128,0002,113,536
4Jul 8, 2026 21:5658,64531,403,46420,485,0001,214,0002,113,536
5Jul 8, 2026 21:5658,68331,409,95620,689,0001,024,0002,113,536
6Jul 8, 2026 21:5659,11631,982,50020,843,0001,030,0002,113,536
7Jul 8, 2026 21:5621,473,8457,957,340,4787,795,822,000149,501,0002,113,536
8Jul 8, 2026 21:5621,481,6167,958,101,0107,797,873,000150,325,0002,113,536
9Jul 8, 2026 21:5621,504,5677,966,595,8887,805,187,000151,503,0002,113,536