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 07:37Rajarshi BasuRajarshi BasuScore: 82,904Success
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 07:3770,952604,668,770468,847,000112,963,0002,301,952
2Jan 8, 2026 07:3782,904700,835,440567,843,000111,969,0002,285,568
3Jan 8, 2026 07:3784,137720,124,793574,938,000114,987,0002,326,528