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 18:41Andrew EpsteinAndrew EpsteinScore: 2,680Success
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 18:422,66530,659,96721,855,000020,480
2Sep 19, 2026 18:422,66530,623,32621,857,000020,480
3Sep 19, 2026 18:422,66630,662,90321,868,000020,480
4Sep 19, 2026 18:422,67930,756,46821,971,000020,480
5Sep 19, 2026 18:422,68030,748,12121,981,000020,480
6Sep 19, 2026 18:422,68130,819,82021,988,000020,480
7Sep 19, 2026 18:422,70132,138,92621,069,0001,084,00020,480
8Sep 19, 2026 18:4217,450151,949,370143,091,000020,480
9Sep 19, 2026 18:4217,734154,247,841145,423,000020,480