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 listOct 19, 2026 22:19e1011e1011Score: 567,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 22:21564,656221,946,86770,846,000138,077,0002,113,536
2Oct 19, 2026 22:21567,194220,868,44570,820,000139,042,0002,113,536
3Oct 19, 2026 22:21567,375221,014,28770,747,000139,182,0002,113,536
4Oct 19, 2026 22:21567,805220,999,73570,959,000139,129,0002,113,536
5Oct 19, 2026 22:21567,956221,077,43670,791,000139,353,0002,113,536
6Oct 19, 2026 22:21568,264221,226,54370,734,000139,524,0002,113,536
7Oct 19, 2026 22:21569,572221,765,01970,837,000139,905,0002,113,536
8Oct 19, 2026 22:21570,118222,427,79770,856,000140,088,0002,113,536
9Oct 19, 2026 22:21572,151222,727,38070,942,000140,754,0002,113,536