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 14:47Dominique GarmierDominique GarmierScore: 10,828Success
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 14:477,81288,309,13863,058,0001,000,0002,306,048
2Mar 26, 2026 14:4710,828112,441,72186,798,0001,995,0002,424,832
3Mar 26, 2026 14:4710,842111,913,04484,910,0003,995,0002,445,312