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 listJan 8, 2026 08:07Rajarshi BasuRajarshi BasuScore: 74,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 08:0770,075602,718,719458,693,000115,922,0002,326,528
2Jan 8, 2026 08:0774,008632,443,892500,887,000105,976,0002,293,760
3Jan 8, 2026 08:0794,438799,903,217660,483,000113,910,0002,322,432