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:04Rajarshi BasuRajarshi BasuScore: 96,278Success
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:0487,243748,650,199587,504,000127,892,0002,424,832
2Jan 2, 2026 08:0496,278822,356,854670,557,000118,921,0002,281,472
3Jan 2, 2026 08:04112,048947,626,099799,823,000118,973,0002,519,040