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:41Ian MckibbenIan MckibbenScore: 12,865Success
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:4112,853132,500,471104,389,0001,003,0002,367,488
2Jan 15, 2025 23:4112,865136,472,504105,497,00002,379,776
3Jan 15, 2025 23:4112,877133,726,136104,584,0001,005,0002,363,392