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 listMay 1, 2026 15:32Pavel SkripkinPavel SkripkinScore: 43,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 15:3343,308372,537,188219,080,000136,050,0002,338,816
2May 1, 2026 15:3343,318375,963,438215,130,000140,084,0002,326,528
3May 1, 2026 15:3343,330371,806,447216,581,000138,732,0002,334,720
4May 1, 2026 15:3343,710371,390,029214,654,000143,768,0002,334,720
5May 1, 2026 15:3343,765377,389,282216,924,000141,950,0002,338,816
6May 1, 2026 15:3344,119380,411,841220,868,000140,915,0002,318,336
7May 1, 2026 15:3344,120379,758,983222,869,000138,918,0002,338,816
8May 1, 2026 15:3344,196378,355,696221,642,000140,772,0002,338,816
9May 1, 2026 15:3344,668385,079,137221,567,000144,717,0002,342,912