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 8, 2026 06:42Rajarshi BasuRajarshi BasuScore: 71,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 06:4270,947605,630,833459,814,000121,950,0002,285,568
2Jan 8, 2026 06:4271,396610,777,310460,563,000124,881,0002,400,256
3Jan 8, 2026 06:4278,465669,282,850524,522,000118,891,0002,285,568