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 24, 2026 06:07Dominique GarmierDominique GarmierScore: 10,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 06:0710,320113,927,15982,610,0002,014,0002,478,080
2Mar 24, 2026 06:0710,461114,484,53583,786,0001,994,0002,396,160
3Mar 24, 2026 06:0710,510117,484,41783,179,0003,006,0002,371,584