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 listDec 31, 2025 08:30Rajarshi BasuRajarshi BasuScore: 29,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 08:3028,369261,391,599229,633,0002,995,0002,297,856
2Dec 31, 2025 08:3029,283262,291,320237,120,0003,001,0002,297,856
3Dec 31, 2025 08:3029,768265,903,363242,095,0002,000,0002,297,856