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 10:53Dominique GarmierDominique GarmierScore: 16,016Success
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 10:5315,985160,909,098128,079,0003,001,0002,428,928
2Mar 24, 2026 10:5316,016159,042,276131,333,00002,383,872
3Mar 24, 2026 10:5316,028156,617,575129,424,0002,006,0002,330,624