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 16:52Victor MerckléVictor MerckléScore: 5,595Success
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 16:535,33952,186,71142,645,0001,136,0002,129,920stderr
2Aug 23, 2026 16:535,34552,323,33942,623,0001,208,0002,129,920stderr
3Aug 23, 2026 16:535,35052,315,70442,686,0001,184,0002,129,920stderr
4Aug 23, 2026 16:535,39052,622,13343,159,0001,040,0002,129,920stderr
5Aug 23, 2026 16:535,59554,974,62044,701,0001,178,0002,129,920stderr
6Aug 23, 2026 16:535,68455,778,98545,554,0001,061,0002,129,920stderr
7Aug 23, 2026 16:535,69955,300,54045,523,0001,210,0002,129,920stderr
8Aug 23, 2026 16:5310,88597,898,13688,230,0001,029,0002,129,920stderr
9Aug 23, 2026 16:5310,90298,557,89988,376,0001,028,0002,129,920stderr