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:16Ian MckibbenIan MckibbenScore: 57,275Success
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:1657,131497,260,084466,474,0001,997,0002,453,504
2Jan 15, 2025 23:1657,275492,034,663467,654,0001,998,0002,469,888
3Jan 15, 2025 23:1657,924497,327,487472,981,0001,999,0002,273,280