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:24Victor MerckléVictor MerckléScore: 5,435Success
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:262,75130,798,61521,476,0001,083,0002,117,632stderr
2Aug 23, 2026 15:262,76930,859,34321,685,0001,022,0002,117,632stderr
3Aug 23, 2026 15:262,77631,017,14721,752,0001,013,0002,117,632stderr
4Aug 23, 2026 15:262,78131,753,23321,784,0001,023,0002,117,632stderr
5Aug 23, 2026 15:265,43552,891,33643,451,0001,123,0002,117,632stderr
6Aug 23, 2026 15:265,46053,052,50743,644,0001,132,0002,117,632stderr
7Aug 23, 2026 15:265,46553,064,78843,694,0001,127,0002,117,632stderr
8Aug 23, 2026 15:265,48553,923,65343,840,0001,143,0002,117,632stderr
9Aug 23, 2026 15:265,54853,700,80444,475,0001,023,0002,117,632stderr