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 listSep 10, 2026 03:00Andrew EpsteinAndrew EpsteinScore: 18,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 03:0118,099158,624,928147,410,0001,005,0002,117,632stderr
2Sep 10, 2026 03:0118,598162,767,159151,500,0001,007,0002,117,632stderr
3Sep 10, 2026 03:0118,627162,953,342151,741,0001,006,0002,117,632stderr
4Sep 10, 2026 03:0118,667163,381,924152,045,0001,031,0002,117,632stderr
5Sep 10, 2026 03:0118,684164,550,625152,189,0001,024,0002,117,632stderr
6Sep 10, 2026 03:0118,684163,466,600152,200,0001,009,0002,117,632stderr
7Sep 10, 2026 03:0118,891165,209,876153,896,0001,017,0002,117,632stderr
8Sep 10, 2026 03:0119,159167,315,206156,073,0001,031,0002,117,632stderr
9Sep 10, 2026 03:0119,223167,778,357156,626,0001,006,0002,117,632stderr