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,707Success
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,68830,899,03522,049,000020,480
2Sep 19, 2026 18:422,69631,559,50322,114,000020,480
3Sep 19, 2026 18:422,69730,853,03422,116,000020,480
4Sep 19, 2026 18:422,69931,602,75222,135,000020,480
5Sep 19, 2026 18:422,70730,956,71922,198,000020,480
6Sep 19, 2026 18:4217,175149,658,630139,784,0001,051,00020,480
7Sep 19, 2026 18:4217,278150,254,576141,680,000020,480
8Sep 19, 2026 18:4217,297150,687,396141,837,000020,480
9Sep 19, 2026 18:4217,762156,412,543145,653,000020,480