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 07:28Ian MckibbenIan MckibbenScore: 274,977Success
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 07:28271,8572,258,702,8342,114,317,000114,908,0002,392,064
2Jan 15, 2025 07:28274,9772,279,346,2922,140,873,000113,940,0002,338,816
3Jan 15, 2025 07:28364,1193,013,306,2222,867,864,000117,912,0002,334,720