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 listAug 21, 2026 15:47Andrew EpsteinAndrew EpsteinScore: 966,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2026 15:51957,7007,863,258,0807,698,410,000154,730,0002,113,536
2Aug 21, 2026 15:51963,0557,907,831,0507,743,224,000153,827,0002,113,536
3Aug 21, 2026 15:51965,1027,925,845,2877,759,975,000153,862,0002,113,536
4Aug 21, 2026 15:51965,9327,931,574,8917,766,322,000154,321,0002,113,536
5Aug 21, 2026 15:51966,0987,933,013,0517,767,850,000154,155,0002,113,536
6Aug 21, 2026 15:51967,4807,944,169,4937,778,416,000154,923,0002,113,536
7Aug 21, 2026 15:51967,7687,946,549,0177,780,934,000154,769,0002,113,536
8Aug 21, 2026 15:51969,4057,959,467,4247,795,495,000153,631,0002,113,536
9Aug 21, 2026 15:51969,9947,964,000,3897,799,684,000154,274,0002,113,536