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 16:54Oleg KovalovOleg KovalovScore: 68,142Success
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 16:5467,464580,270,511413,151,000140,051,0002,342,912
2Jan 27, 2025 16:5468,142585,721,192419,824,000138,941,0002,510,848
3Jan 27, 2025 16:5481,621693,435,281527,442,000141,850,0002,408,448