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:27Rajarshi BasuRajarshi BasuScore: 100,366Success
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:2710,549113,154,19979,464,0007,041,0002,367,488
2Jan 2, 2026 05:27100,366858,148,476701,149,000121,852,0002,433,024
3Jan 2, 2026 05:27105,945898,375,499739,783,000128,962,0002,297,856