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 19:17Victor MerckléVictor MerckléScore: 5,417Success
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 19:182,75430,918,75721,476,0001,111,0002,142,208stderr
2Aug 23, 2026 19:182,75631,629,29021,578,0001,025,0002,142,208stderr
3Aug 23, 2026 19:182,80631,248,53521,880,0001,137,0002,142,208stderr
4Aug 23, 2026 19:185,40952,612,07443,275,0001,082,0002,150,400stderr
5Aug 23, 2026 19:185,41752,595,54643,245,0001,178,0002,150,400stderr
6Aug 23, 2026 19:185,44152,838,68843,465,0001,153,0002,142,208stderr
7Aug 23, 2026 19:185,44952,796,50043,613,0001,069,0002,142,208stderr
8Aug 23, 2026 19:185,46353,092,85143,628,0001,176,0002,150,400stderr
9Aug 23, 2026 19:1829,460249,687,095240,567,0001,005,0002,142,208stderr