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 10, 2026 13:25Pavel SkripkinPavel SkripkinScore: 24,282Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:274,04741,701,02229,856,0003,330,0002,117,632
2May 10, 2026 13:274,09543,327,92830,484,0003,098,0002,117,632
3May 10, 2026 13:274,20441,992,39531,399,0003,076,0002,117,632
4May 10, 2026 13:274,26042,190,81031,848,0003,084,0002,117,632
5May 10, 2026 13:2724,282208,632,003195,094,0004,025,0002,117,632
6May 10, 2026 13:2724,358208,725,135196,567,0003,175,0002,117,632
7May 10, 2026 13:2725,076213,687,301202,418,0003,213,0002,117,632
8May 10, 2026 13:2725,348215,236,892203,305,0004,551,0002,117,632
9May 10, 2026 13:2725,891220,707,344209,144,0003,167,0002,117,632