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 20, 2026 11:07Dominique GarmierDominique GarmierScore: 15,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 11:0715,055152,114,629121,447,0002,007,0002,433,024
2Mar 20, 2026 11:0715,101153,531,815122,827,000998,0002,330,624
3Mar 20, 2026 11:0715,233153,861,261122,911,0001,998,0002,486,272