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 12:39Victor MerckléVictor MerckléScore: 2,753Success
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 12:402,72430,619,26521,266,0001,078,0002,117,632stderr
2Aug 29, 2026 12:402,72630,619,58021,270,0001,088,0002,117,632stderr
3Aug 29, 2026 12:402,73030,710,85921,278,0001,109,0002,117,632stderr
4Aug 29, 2026 12:402,74238,180,80721,378,0001,108,0002,117,632stderr
5Aug 29, 2026 12:402,75330,718,34321,548,0001,027,0002,117,632stderr
6Aug 29, 2026 12:402,76430,986,69221,643,0001,024,0002,117,632stderr
7Aug 29, 2026 12:402,76530,807,80521,644,0001,031,0002,117,632stderr
8Aug 29, 2026 12:402,77133,222,43121,647,0001,081,0002,117,632stderr
9Aug 29, 2026 12:402,80863,948,47122,004,0001,023,0002,117,632stderr