Median Sergey Svistunov

Find the median of 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 median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listJun 21, 2026 19:28A_ShamanA_ShamanScore: 74,814Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 19:2874,532620,388,732428,849,000182,315,0002,113,536
2Jun 21, 2026 19:2874,642621,452,255431,653,000180,419,0002,113,536
3Jun 21, 2026 19:2874,695621,595,459429,360,000183,147,0002,113,536
4Jun 21, 2026 19:2874,752622,093,240431,890,000181,081,0002,113,536
5Jun 21, 2026 19:2874,814622,568,775429,678,000183,803,0002,113,536
6Jun 21, 2026 19:2875,165625,430,142431,692,000184,664,0002,113,536
7Jun 21, 2026 19:2875,378627,323,429435,382,000182,720,0002,113,536
8Jun 21, 2026 19:2875,451627,824,468431,650,000187,052,0002,113,536
9Jun 21, 2026 19:2875,602628,992,566436,148,000183,794,0002,113,536