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 29, 2026 20:54IlyaIlyaScore: 59,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 20:5559,84831,552,73421,061,0001,083,0002,113,536
2Jun 29, 2026 20:5559,93231,620,05221,065,0001,110,0002,113,536
3Jun 29, 2026 20:5559,93231,644,68121,052,0001,123,0002,113,536
4Jun 29, 2026 20:5559,93531,556,79021,058,0001,118,0002,113,536
5Jun 29, 2026 20:5559,97031,695,18521,075,0001,114,0002,113,536
6Jun 29, 2026 20:5560,17031,718,75021,067,0001,196,0002,113,536
7Jun 29, 2026 20:5560,21031,741,93721,149,0001,129,0002,113,536
8Jun 29, 2026 20:5560,28132,237,16521,141,0001,163,0002,113,536
9Jun 29, 2026 20:5560,53232,358,93121,171,0001,226,0002,113,536