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 listJun 16, 2026 19:29Maya RebholzMaya RebholzError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 19:29010,483,76101,537,0002,121,728expected "2134801875 ", got "7 "
2Jun 16, 2026 19:29010,894,97801,587,0002,121,728expected "2185363522 ", got "7 "
3Jun 16, 2026 19:29010,897,51201,578,0002,121,728expected "2182000180 ", got "7 "