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 04:30Rajarshi BasuRajarshi BasuScore: 36,330Success
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 04:3036,121322,799,182146,094,000150,097,0002,514,944
2Jan 2, 2026 04:3036,330329,894,061148,953,000148,953,0002,404,352
3Jan 2, 2026 04:3038,257346,149,751163,847,000149,860,0002,293,760