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 listJul 15, 2023 20:06MaximeMaximeScore: 986,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2023 20:06980,7198,106,036,7978,041,892,85202,297,856
2Jul 15, 2023 20:06986,1518,150,933,4788,086,434,24402,277,376
3Jul 15, 2023 20:06987,2878,157,188,4278,095,751,42202,293,760