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 1, 2026 13:41Pavel SkripkinPavel SkripkinScore: 54,255Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 13:4253,195456,248,890298,139,000138,064,0002,473,984
2May 1, 2026 13:4253,629458,121,792297,841,000141,924,0002,478,080
3May 1, 2026 13:4253,640461,449,405303,898,000135,954,0002,473,984
4May 1, 2026 13:4253,909458,565,875302,040,000140,018,0002,478,080
5May 1, 2026 13:4254,255459,540,278306,930,000137,968,0002,469,888
6May 1, 2026 13:4254,360465,138,487305,833,000139,923,0002,473,984
7May 1, 2026 13:4255,198471,616,803315,738,000136,886,0002,412,544
8May 1, 2026 13:4255,477472,077,963308,941,000145,972,0002,473,984
9May 1, 2026 13:4255,608471,185,073310,994,000144,997,0002,461,696