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 listMar 21, 2026 04:32Yuriy LyfenkoYuriy LyfenkoScore: 4,087Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 04:324,053559,031,24430,216,0003,021,0002,326,528
2Mar 21, 2026 04:324,087561,720,22131,484,0002,031,0002,363,392
3Mar 21, 2026 04:324,108559,343,43530,714,0002,972,0002,375,680