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 28, 2025 00:14Ian MckibbenIan MckibbenScore: 10,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 00:1410,487107,910,28584,994,000999,0002,297,856
2Jan 28, 2025 00:1410,536110,251,16486,397,00002,297,856
3Jan 28, 2025 00:1410,536107,999,88185,395,0001,004,0002,486,272