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 listMar 29, 2026 21:47Dominique GarmierDominique GarmierScore: 18,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 21:4718,270176,805,090147,815,0001,997,0002,461,696
2Mar 29, 2026 21:4718,535178,473,706149,992,0001,999,0002,375,680
3Mar 29, 2026 21:4718,827177,887,788154,385,00002,375,680