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 listApr 21, 2026 07:01olliecrowolliecrowScore: 3,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 07:023,56349,677,16726,197,0003,022,0002,428,928
2Apr 21, 2026 07:023,56751,718,18127,240,0002,017,0002,260,992
3Apr 21, 2026 07:023,58852,659,07827,397,0002,029,0002,326,528
4Apr 21, 2026 07:023,65356,623,15028,960,000998,0002,314,240
5Apr 21, 2026 07:023,66059,625,53727,018,0003,002,0002,306,048
6Apr 21, 2026 07:023,69553,687,90125,252,0005,050,0002,392,064
7Apr 21, 2026 07:023,70454,702,99425,314,0005,062,0002,457,600
8Apr 21, 2026 07:023,75557,625,65323,844,0006,954,0002,478,080
9Apr 21, 2026 07:0224,418224,615,909196,226,0004,004,0002,412,544