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 26, 2026 13:02Dominique GarmierDominique GarmierScore: 10,133Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 13:0210,126110,519,36981,033,0002,000,0002,482,176
2Mar 26, 2026 13:0210,133109,268,74381,091,0002,002,0002,461,696
3Mar 26, 2026 13:0210,232109,778,98180,903,0002,996,0002,293,760