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 27, 2025 23:50Ian MckibbenIan MckibbenScore: 65,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 27, 2025 23:5065,390564,420,589407,388,000128,806,0002,318,336
2Jan 27, 2025 23:5065,629560,877,044401,119,000137,040,0002,408,448
3Jan 27, 2025 23:5066,482570,721,538428,121,000117,033,0002,347,008