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 2, 2026 05:11Rajarshi BasuRajarshi BasuScore: 11,977Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 05:1110,562113,151,56674,666,00011,946,0002,351,104
2Jan 2, 2026 05:1111,977122,986,32980,173,00018,038,0002,469,888
3Jan 2, 2026 05:11108,256917,071,190769,741,000117,960,0002,281,472