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 listOct 3, 2026 00:26Karthik ReddyKarthik ReddyScore: 3,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 00:273,0106,033,793,93522,790,0001,895,00020,480
2Oct 3, 2026 00:273,0246,034,143,03221,831,0002,967,00020,480
3Oct 3, 2026 00:273,0436,034,206,19521,757,0003,198,00020,480
4Oct 3, 2026 00:273,1906,035,315,28721,910,0004,251,00020,480
5Oct 3, 2026 00:273,2386,035,738,37121,913,0004,646,00020,480
6Oct 3, 2026 00:273,3276,036,591,24921,942,0005,347,00020,480
7Oct 3, 2026 00:273,3396,036,590,73821,906,0005,476,00020,480
8Oct 3, 2026 00:273,3586,036,711,56821,967,0005,570,00020,480
9Oct 3, 2026 00:273,5386,039,194,06721,881,0007,135,00020,480