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 listApr 30, 2026 12:18olliecrowolliecrowScore: 24,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 12:183,67550,250,79928,131,0002,009,0002,334,720
2Apr 30, 2026 12:183,69451,698,07228,279,0002,019,0002,297,856
3Apr 30, 2026 12:183,72852,085,04629,551,0001,019,0002,326,528
4Apr 30, 2026 12:183,75948,132,18328,836,0001,988,0002,543,616
5Apr 30, 2026 12:1824,151217,883,101193,042,0005,001,0002,330,624
6Apr 30, 2026 12:1824,193216,415,366195,384,0003,005,0002,469,888
7Apr 30, 2026 12:1824,238212,637,122194,762,0003,995,0002,330,624
8Apr 30, 2026 12:1824,264217,198,433194,971,0003,999,0002,506,752
9Apr 30, 2026 12:1824,285214,969,081194,136,0005,003,0002,441,216