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 06:24Rajarshi BasuRajarshi BasuScore: 4,760Success
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 06:244,75262,373,99733,968,0004,995,0002,457,600
2Jan 2, 2026 06:244,76063,430,72733,024,0006,004,0002,404,352
3Jan 2, 2026 06:24101,138859,930,162711,424,000117,904,0002,445,312