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 21, 2026 00:39Taylor DettlingTaylor DettlingScore: 318,456Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 00:40318,2492,634,671,7662,431,803,000177,839,0002,265,088
2Apr 21, 2026 00:40318,4562,628,686,3562,430,528,000180,816,0002,396,160
3Apr 21, 2026 00:40318,7022,636,668,2972,431,544,000181,816,0002,359,296