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 14:38Dominique GarmierDominique GarmierScore: 13,635Success
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 14:3813,607141,243,094110,574,0001,005,0002,301,952
2Mar 19, 2026 14:3813,635137,809,696109,807,0001,996,0002,342,912
3Mar 19, 2026 14:3813,651136,743,532110,940,000999,0002,359,296