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 7, 2026 05:29Rajarshi BasuRajarshi BasuScore: 70,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 05:304,73567,518,25232,854,0005,973,0002,412,544
2Jan 7, 2026 05:295,10276,140,41138,846,0002,988,0002,441,216
3Jan 7, 2026 05:305,38179,687,41642,123,0002,005,0002,465,792
4Jan 7, 2026 05:2970,970607,399,473458,965,000122,990,0002,519,040
5Jan 7, 2026 05:2984,512722,604,364579,999,000112,999,0002,392,064
6Jan 7, 2026 05:3086,098729,650,897583,179,000122,827,0002,265,088