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 6, 2025 07:57Aniruddha DebAniruddha DebScore: 12,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 07:5712,799131,319,276101,951,0002,998,0002,277,376
2Jul 6, 2025 07:5712,987136,618,540102,472,0004,018,0002,318,336
3Jul 6, 2025 07:5713,991140,115,585111,731,0002,992,0002,519,040