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 6, 2026 10:24Rajarshi BasuRajarshi BasuScore: 5,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 6, 2026 10:245,07770,906,61337,568,0004,061,0002,342,912
2Jan 6, 2026 10:245,63570,471,62739,175,0007,031,0002,523,136
3Jan 6, 2026 10:2482,089705,225,106543,299,000129,832,0002,281,472