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 9, 2025 09:38Ian MckibbenIan MckibbenScore: 85,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 09:3879,782684,827,971450,459,000203,755,0002,469,888
2Jan 9, 2025 09:2783,328716,512,687470,509,000212,778,0002,461,696
3Jan 9, 2025 09:2783,450715,915,549461,519,000222,768,0002,387,968
4Jan 9, 2025 09:2785,464726,163,585477,867,000222,937,0002,424,832
5Jan 9, 2025 09:3886,790740,066,756490,781,000220,901,0002,318,336
6Jan 9, 2025 09:3888,769757,309,737497,934,000229,969,0002,510,848