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 20:19Ian MckibbenIan MckibbenScore: 57,313Success
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 20:1957,184494,866,156467,907,000999,0002,347,008
2Jan 15, 2025 20:1957,313492,917,266468,964,000999,0002,322,432
3Jan 15, 2025 20:1957,875504,329,317472,575,0001,998,0002,363,392