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:24Rajarshi BasuRajarshi BasuScore: 85,540Success
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:2421,751204,750,58939,078,000139,279,0002,379,776
2Jan 2, 2026 04:2485,540726,661,535563,538,000137,887,0002,437,120
3Jan 2, 2026 04:24103,507882,518,382705,968,000142,791,0002,301,952