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 29, 2026 10:15Victor MerckléVictor MerckléScore: 2,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 10:162,72630,718,64921,276,0001,081,0002,117,632stderr
2Aug 29, 2026 10:162,74230,894,63121,416,0001,073,0002,117,632stderr
3Aug 29, 2026 10:162,74530,876,39021,336,0001,174,0002,117,632stderr
4Aug 29, 2026 10:162,74530,868,43621,500,0001,010,0002,117,632stderr
5Aug 29, 2026 10:162,74730,861,17221,446,0001,082,0002,117,632stderr
6Aug 29, 2026 10:162,76431,689,08521,656,0001,015,0002,117,632stderr
7Aug 29, 2026 10:162,83631,631,40322,067,0001,191,0002,117,632stderr
8Aug 29, 2026 10:165,37352,586,24843,030,0001,036,0002,117,632stderr
9Aug 29, 2026 10:165,38752,879,37543,145,0001,036,0002,117,632stderr