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 23, 2024 16:18DanielDanielScore: 70,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2024 16:1863,214593,550,253518,357,10002,199,552
2Jul 23, 2024 16:1870,165637,184,346575,351,40502,183,168
3Jul 23, 2024 16:1872,895665,852,376597,737,87802,211,840