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 19, 2026 01:17Dominique GarmierDominique GarmierScore: 18,885Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 01:1718,594174,340,439151,466,0001,003,0002,433,024
2Mar 19, 2026 01:1718,885183,194,196153,854,000999,0002,445,312
3Mar 19, 2026 01:1718,919180,059,742153,134,0002,001,0002,375,680