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:39Rajarshi BasuRajarshi BasuScore: 19,759Success
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:3918,893184,665,718146,926,0007,995,0002,383,872
2Jan 2, 2026 04:3919,759195,275,001153,020,0009,001,0002,338,816
3Jan 2, 2026 04:39114,962969,120,215815,732,000126,958,0002,297,856