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 2, 2026 21:53Karthik ReddyKarthik ReddyScore: 30,477Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 21:5430,4576,259,181,194249,755,000020,480
2Oct 2, 2026 21:5430,4776,259,248,592249,913,000020,480
3Oct 2, 2026 21:5431,2806,265,802,042256,497,000020,480