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 8, 2026 07:05Rajarshi BasuRajarshi BasuScore: 81,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 07:067,06581,550,28453,941,0003,995,0002,375,680
2Jan 8, 2026 07:067,11985,088,65353,345,0005,032,0002,379,776
3Jan 8, 2026 07:0573,081625,767,423475,415,000123,847,0002,306,048
4Jan 8, 2026 07:0581,725696,574,552551,298,000118,848,0002,371,584
5Jan 8, 2026 07:0590,436767,321,761627,641,000113,934,0002,445,312
6Jan 8, 2026 07:0694,515801,714,427653,177,000121,846,0002,412,544