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 28, 2026 18:05Dominique GarmierDominique GarmierScore: 15,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 18:4615,457150,896,187124,755,0001,996,0002,457,600
2Mar 28, 2026 18:4615,498151,907,406124,081,0003,001,0002,490,368
3Mar 28, 2026 18:0515,546155,168,429126,477,0001,003,0002,424,832
4Mar 28, 2026 18:0515,558153,335,017125,567,0002,009,0002,359,296
5Mar 28, 2026 18:4615,574150,647,057125,710,0001,995,0002,510,848
6Mar 28, 2026 18:0515,607159,079,516125,977,0001,999,0002,355,200