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 23, 2026 15:38Andrew EpsteinAndrew EpsteinScore: 30,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 15:4029,801254,170,085243,332,0001,043,0002,113,536
2Aug 23, 2026 15:4030,127256,905,687246,002,0001,045,0002,113,536
3Aug 23, 2026 15:4030,224257,642,062246,818,0001,025,0002,113,536
4Aug 23, 2026 15:4030,490259,837,421248,960,0001,062,0002,113,536
5Aug 23, 2026 15:4030,657262,456,650250,327,0001,061,0002,113,536
6Aug 23, 2026 15:4031,097264,873,571253,918,0001,080,0002,113,536
7Aug 23, 2026 15:4031,349266,947,316255,967,0001,099,0002,113,536
8Aug 23, 2026 15:4031,990272,199,478261,240,0001,083,0002,113,536
9Aug 23, 2026 15:4032,919279,724,649268,893,0001,046,0002,113,536