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 2, 2026 08:05Rajarshi BasuRajarshi BasuScore: 88,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 08:055,38172,790,47934,096,00010,028,0002,347,008
2Jan 2, 2026 08:0588,733753,359,386603,680,000123,934,0002,330,624
3Jan 2, 2026 08:05104,373881,935,983739,013,000116,844,0002,486,272