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 23, 2026 17:37Dominique GarmierDominique GarmierScore: 17,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 23, 2026 17:3716,100163,577,342120,017,00012,001,0002,437,120
2Mar 23, 2026 17:3717,101167,648,033129,208,00011,017,0002,306,048
3Mar 23, 2026 17:3717,649174,478,016134,739,0009,980,0002,301,952