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 23, 2026 15:13Dominique GarmierDominique GarmierScore: 15,037Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 15:1314,853149,069,249120,800,000998,0002,400,256
2Mar 23, 2026 15:1315,037146,984,492120,300,0003,007,0002,486,272
3Mar 23, 2026 15:1315,090151,276,303120,746,0002,993,0002,269,184