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 listSep 19, 2026 15:29Andrew EpsteinAndrew EpsteinScore: 24,169Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 15:3023,891206,377,088193,901,0002,011,0002,117,632stderr
2Sep 19, 2026 15:3024,053207,611,521194,049,0003,187,0002,117,632stderr
3Sep 19, 2026 15:3024,133208,410,513195,885,0002,013,0002,117,632stderr
4Sep 19, 2026 15:3024,144209,096,365194,938,0003,044,0002,117,632stderr
5Sep 19, 2026 15:3024,169208,587,901195,175,0003,016,0002,117,632stderr
6Sep 19, 2026 15:3024,197208,829,056195,186,0003,237,0002,117,632stderr
7Sep 19, 2026 15:3024,269209,369,056195,868,0003,140,0002,117,632stderr
8Sep 19, 2026 15:3024,321209,937,757196,210,0003,227,0002,117,632stderr
9Sep 19, 2026 15:3024,372210,978,207196,709,0003,149,0002,117,632stderr