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:40Rajarshi BasuRajarshi BasuScore: 69,645Success
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:404,83564,311,65933,547,0006,099,0002,465,792
2Jan 6, 2026 10:404,88868,716,35637,077,0003,006,0002,297,856
3Jan 6, 2026 10:405,37769,628,61042,085,0002,004,0002,486,272
4Jan 6, 2026 10:4069,645598,770,430460,267,000110,823,0002,453,504
5Jan 6, 2026 10:4075,484652,953,520495,975,000122,993,0002,531,328
6Jan 6, 2026 10:4080,932695,555,441536,713,000126,932,0002,473,984