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 22, 2026 20:22Dominique GarmierDominique GarmierScore: 20,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 20:2220,504197,645,519166,129,0002,001,0002,519,040
2Mar 22, 2026 20:2220,625197,201,580166,126,0003,002,0002,265,088
3Mar 22, 2026 20:2220,665194,335,815167,446,0002,005,0002,269,184