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 listJan 15, 2025 23:55Ian MckibbenIan MckibbenScore: 14,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2025 23:5514,098138,544,662113,610,0001,993,0002,416,640
2Jan 15, 2025 23:5514,104136,511,572114,650,0001,005,0002,461,696
3Jan 15, 2025 23:5514,105146,368,970115,664,00002,416,640
4Jan 15, 2025 23:5514,120138,772,610113,787,0001,996,0002,424,832
5Jan 15, 2025 23:5514,171139,611,652114,200,0002,003,0002,412,544
6Jan 15, 2025 23:5514,191147,677,785115,366,0001,003,0002,457,600