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 25, 2026 04:06Dominique GarmierDominique GarmierScore: 14,109Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 04:0613,969145,757,133111,534,0003,014,0002,490,368
2Mar 25, 2026 04:0614,109148,315,728115,696,00002,387,968
3Mar 25, 2026 04:0614,261142,957,591114,940,0001,998,0002,461,696