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 09:59IlyaIlyaError
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 10:01031,900,97520,787,0001,183,00016,384No answer to stdout. Died or killed?
2Jun 30, 2026 10:0159,81031,642,12921,020,0001,110,0002,113,536
3Jun 30, 2026 10:0160,14831,916,34921,105,0001,150,0002,113,536
4Jun 30, 2026 10:0160,17031,827,14621,128,0001,135,0002,113,536
5Jun 30, 2026 10:0160,27231,715,14121,100,0001,201,0002,113,536
6Jun 30, 2026 10:0160,48332,302,63521,184,0001,195,0002,113,536
7Jun 30, 2026 10:0164,87843,234,94822,977,0001,028,0002,117,632