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:07Rajarshi BasuRajarshi BasuScore: 106,650Success
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:074,97966,673,28432,859,0007,965,0002,314,240
2Jan 2, 2026 08:07106,650902,497,245768,586,000105,942,0002,355,200
3Jan 2, 2026 08:07107,713916,201,994761,352,000121,896,0002,314,240