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 18, 2026 15:08Charles CabergsCharles CabergsScore: 11,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 15:0811,656127,194,71094,576,0001,006,0002,330,624
2Apr 18, 2026 15:0811,778126,843,92293,562,0003,018,0002,404,352
3Apr 18, 2026 15:0811,804123,404,67194,794,0001,995,0002,469,888
4Apr 18, 2026 15:0811,804125,464,69094,799,0001,995,0002,396,160
5Apr 18, 2026 15:0811,805123,848,18694,803,0001,995,0002,523,136
6Apr 18, 2026 15:0811,827123,680,06792,982,0003,999,0002,502,656
7Apr 18, 2026 15:0811,835122,479,85995,047,0002,000,0002,363,392
8Apr 18, 2026 15:0811,849123,477,51196,160,0001,001,0002,424,832
9Apr 18, 2026 15:0811,935123,664,19493,877,0003,994,0002,326,528