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 11, 2026 18:31Pavel SkripkinPavel SkripkinScore: 24,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 18:314,06040,898,25430,120,0003,179,0002,117,632
2May 11, 2026 18:314,14741,325,97230,642,0003,364,0002,117,632
3May 11, 2026 18:314,15742,137,47830,628,0003,466,0002,117,632
4May 11, 2026 18:314,24742,204,61231,296,0003,532,0002,117,632
5May 11, 2026 18:3124,246206,148,463195,439,0003,379,0002,117,632
6May 11, 2026 18:3125,112216,071,999202,600,0003,326,0002,117,632
7May 11, 2026 18:3125,244215,439,980203,727,0003,275,0002,117,632
8May 11, 2026 18:3125,569217,068,719206,415,0003,256,0002,117,632
9May 11, 2026 18:3125,591217,206,606206,800,0003,053,0002,117,632