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:30Rajarshi BasuRajarshi BasuScore: 77,174Success
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:3071,660618,203,485475,688,000111,926,0002,494,464
2Jan 8, 2026 08:3077,174663,232,194520,859,000111,969,0002,490,368
3Jan 8, 2026 08:3080,643687,468,723555,387,000105,883,0002,285,568