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 7, 2026 12:17IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 12:18030,964,40820,141,0001,239,0002,113,536expected "429496560367 ", got "429496420155 "
2Jul 7, 2026 12:1821,646,2568,019,002,5547,853,152,000155,963,0002,113,536
3Jul 7, 2026 12:1821,662,6728,025,620,1347,861,685,000153,504,0002,113,536