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 17:33Andrew EpsteinAndrew EpsteinScore: 2,729Success
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 17:342,71831,124,91221,208,0001,085,00020,480
2Sep 19, 2026 17:342,72631,178,47821,339,0001,016,00020,480
3Sep 19, 2026 17:342,72731,195,27621,305,0001,063,00020,480
4Sep 19, 2026 17:342,72731,165,97321,328,0001,039,00020,480
5Sep 19, 2026 17:342,72931,128,48121,307,0001,074,00020,480
6Sep 19, 2026 17:342,74931,969,35821,431,0001,115,00020,480
7Sep 19, 2026 17:342,75331,415,15721,521,0001,061,00020,480
8Sep 19, 2026 17:3417,309150,716,568140,924,0001,017,00020,480
9Sep 19, 2026 17:3417,776154,570,922144,752,0001,012,00020,480