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 28, 2026 20:27olliecrowolliecrowScore: 23,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 20:283,32643,523,38325,257,0002,020,0002,523,136
2Apr 28, 2026 20:283,33844,348,55126,362,0001,013,0002,330,624
3Apr 28, 2026 20:283,35343,450,87727,499,00002,412,544
4Apr 28, 2026 20:283,37443,963,17626,648,0001,024,0002,424,832
5Apr 28, 2026 20:2823,875216,077,614192,784,0002,996,0002,367,488
6Apr 28, 2026 20:2823,880212,574,184190,824,0004,995,0002,367,488
7Apr 28, 2026 20:2823,904214,371,472193,017,0003,000,0002,502,656
8Apr 28, 2026 20:2823,921213,838,118195,154,0001,000,0002,523,136
9Apr 28, 2026 20:2823,935210,372,025195,266,0001,001,0002,367,488