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 22, 2026 12:18Dominique GarmierDominique GarmierScore: 17,855Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 12:1817,707170,800,382144,193,0001,001,0002,277,376
2Mar 22, 2026 12:1817,855169,648,573144,407,0002,005,0002,285,568
3Mar 22, 2026 12:1817,899188,020,335144,803,0001,970,0002,285,568