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 24, 2026 23:47Dominique GarmierDominique GarmierScore: 10,111Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 23:4710,098114,005,87979,811,0002,992,0002,465,792
2Mar 24, 2026 23:4710,111112,533,71678,919,0003,995,0002,416,640
3Mar 24, 2026 23:4710,117106,913,31980,964,0001,999,0002,355,200