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 08:04Rajarshi BasuRajarshi BasuScore: 88,059Success
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 08:0480,467685,119,218543,859,000115,969,0002,510,848
2Jan 2, 2026 08:0488,059749,473,758606,229,000115,852,0002,523,136
3Jan 2, 2026 08:0488,693755,767,814608,402,000118,883,0002,281,472