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 27, 2026 13:36Dominique GarmierDominique GarmierScore: 11,375Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 13:3611,350119,577,95491,073,0002,001,0002,404,352
2Mar 27, 2026 13:3611,375114,457,73590,267,0003,008,0002,318,336
3Mar 27, 2026 13:3611,412125,364,84592,570,0001,006,0002,400,256