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:03Dominique GarmierDominique GarmierScore: 14,959Success
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:0314,921146,909,259122,355,00002,281,472
2Mar 23, 2026 17:0314,959146,560,330121,668,000997,0002,281,472
3Mar 23, 2026 17:0314,988152,471,935120,906,0001,998,0002,396,160